Time complexity is O(n* 2^n). Space complexity is 0(1).
Category Archives: Uncategorized
LintCode 17 LeetCode 78 – Python 3 (Week 09 – 02)
Most all possible solution problem is about searching. Most searching questions can be solved by recursion. Time complexity is O(n * 2^n). Space complexity is 0(1).
LintCode 13 – Python 3 (Week 09 – 01)
LeetCode 2 – Python 3 (Week 06 – 15)
Solution 1 Time complexity is O(max(m,n)). Space complexity is O(max(m,n)).
LeetCode 46 – Python 3 (Week 06 – 14)
Solution 1 Time complexity is O(n!). Space complexity is O(1). Solution 2 Time complexity is O(n!). Space complexity is O(1).
LeetCode 412 – Python 3 (Week 06 – 13)
Solution 1 Time complexity is O(n). Space complexity is O(1)
LeetCode 387 – Python 3 (Week 06 – 12)
Solution 1 Time complexity is O(n). Space complexity is O(n).
*LeetCode 350 – Python 3 (Week 06 – 11)
I am not sure if the time complexity is right. Solution 1 Time complexity is O(n^2). Space complexity is O(m+n).
LeetCode 344 – Python 3 (Week 06 – 10)
Solution 1 class Solution: def reverseString(self, s: List[str]) -> None: “”” Do not return anything, modify s in-place instead. “”” for i in range(len(s) // 2): s[i], s[-i-1] = s[-i-1], s[i] Time complexity is O(n). Space complexity is O(1).
LeetCode 326 – Python 3 (Week 06 – 09)
Solution 1 Time complexity is O(1). Space complexity is O(1).
步步发财 