Wangdu wangdu1005
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| func fib(_ N: Int) -> Int { | |
| return self.recursiveWay(N) | |
| } | |
| func recursiveWay(_ N: Int) -> Int { | |
| if N == 0 { return 0 } |
wangdu1005
/ Is_Palindrome.swift
Created
June 12, 2019 07:58
We divided the input by 10 for every iteration, so the time complexity is O(log10(n)) Space complexity : O(1).
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| func isPalindrome(_ x: Int) -> Bool { | |
| return self.reverseWay(x) | |
| } | |
| // Recommanded | |
| func reverseWay(_ x: Int) -> Bool { | |
OlderNewer