add complexity

Author: kamyu104

Python/01-matrix.py

@@ -8,6 +8,7 @@
 except NameError:
     xrange = range  # Python 3
 
+
 class Solution(object):
     def updateMatrix(self, matrix):
         """
@@ -35,6 +36,10 @@ def updateMatrix(self, matrix):
 
         return matrix
 
+
+# Time:  O(m * n)
+# Space: O(m * n)
+# dp solution
 class Solution2(object):
     def updateMatrix(self, matrix):
         """

Python/1-bit-and-2-bit-characters.py

@@ -6,6 +6,7 @@
 except NameError:
     xrange = range  # Python 3
 
+
 class Solution(object):
     def isOneBitCharacter(self, bits):
         """

Python/132-pattern.py

@@ -6,6 +6,7 @@
 except NameError:
     xrange = range  # Python 3
 
+
 class Solution(object):
     def find132pattern(self, nums):
         """

Python/24-game.py

@@ -9,6 +9,7 @@
 except NameError:
     xrange = range  # Python 3
 
+
 class Solution(object):
     def judgePoint24(self, nums):
         """
@@ -33,6 +34,9 @@ def judgePoint24(self, nums):
                     next_nums.pop()
         return False
 
+
+# Time:  O(n^3 * 4^n) = O(1), n = 4
+# Space: O(n^2) = O(1)
 class Solution2(object):
     def judgePoint24(self, nums):
         """

Python/3sum.py

@@ -3,6 +3,7 @@
 
 import collections
 
+
 class Solution(object):
     def threeSum(self, nums):
         """

Python/4-keys-keyboard.py

@@ -6,6 +6,7 @@
 except NameError:
     xrange = range  # Python 3
 
+
 class Solution(object):
     def maxA(self, N):
         """
@@ -25,6 +26,9 @@ def maxA(self, N):
         n4 = n - n3
         return 3**n3 * 4**n4
 
+
+# Time:  O(n)
+# Space: O(1)
 class Solution2(object):
     def maxA(self, N):
         """

Python/4sum-ii.py

@@ -3,6 +3,7 @@
 
 import collections
 
+
 class Solution(object):
     def fourSumCount(self, A, B, C, D):
         """

Python/4sum.py

@@ -8,6 +8,8 @@
 except NameError:
     xrange = range  # Python 3
 
+
+# Two pointer solution. (1356ms)
 class Solution(object):
     def fourSum(self, nums, target):
         """
@@ -40,6 +42,10 @@ def fourSum(self, nums, target):
                         left += 1
         return res
 
+
+# Time:  O(n^2 * p)
+# Space: O(n^2 * p)
+# Hash solution. (224ms)
 class Solution2(object):
     def fourSum(self, nums, target):
         """
@@ -70,6 +76,9 @@ def fourSum(self, nums, target):
                                 result.append(quad)
         return result
 
+
+# Time:  O(n^2 * p) ~ O(n^4)
+# Space: O(n^2)
 class Solution3(object):
     def fourSum(self, nums, target):
         """

Python/accounts-merge.py

@@ -9,6 +9,7 @@
 except NameError:
     xrange = range  # Python 3
 
+
 class UnionFind(object):
     def __init__(self):
         self.set = []
@@ -27,6 +28,7 @@ def union_set(self, x, y):
         if x_root != y_root:
             self.set[min(x_root, y_root)] = max(x_root, y_root)
 
+
 class Solution(object):
     def accountsMerge(self, accounts):
         """

Python/add-and-search-word-data-structure-design.py

@@ -7,6 +7,7 @@ def __init__(self):
         self.is_string = False
         self.leaves = {}
 
+
 class WordDictionary:
     def __init__(self):
         self.root = TrieNode()
@@ -41,3 +42,4 @@ def searchHelper(self, word, start, curr):
 
         return False
 
+

Python/add-binary.py

@@ -6,6 +6,7 @@
 except NameError:
     xrange = range  # Python 3
 
+
 class Solution:
     # @param a, a string
     # @param b, a string

Python/add-bold-tag-in-string.py

@@ -9,6 +9,8 @@
 except NameError:
     xrange = range  # Python 3
 
+
+# 59ms
 class Solution(object):
     def addBoldTag(self, s, dict):
         """
@@ -32,6 +34,10 @@ def addBoldTag(self, s, dict):
                 result.append("</b>")
         return "".join(result)
 
+
+# Time:  O(n * l), l is the average string length
+# Space: O(t)    , t is the size of trie
+# trie solution, 439ms
 class Solution2(object):
     def addBoldTag(self, s, words):
         """

Python/add-one-row-to-tree.py

@@ -7,6 +7,7 @@ def __init__(self, x):
         self.left = None
         self.right = None
 
+
 class Solution(object):
     def addOneRow(self, root, v, d):
         """

Python/add-two-numbers-ii.py

@@ -6,6 +6,7 @@ def __init__(self, x):
         self.val = x
         self.next = None
 
+
 class Solution(object):
     def addTwoNumbers(self, l1, l2):
         """

Python/add-two-numbers.py

@@ -6,6 +6,7 @@ def __init__(self, x):
         self.val = x
         self.next = None
 
+
 class Solution(object):
     def addTwoNumbers(self, l1, l2):
         """

Python/additive-number.py

@@ -6,6 +6,7 @@
 except NameError:
     xrange = range  # Python 3
 
+
 class Solution(object):
     def isAdditiveNumber(self, num):
         """

Python/alien-dictionary.py

@@ -8,6 +8,8 @@
 except NameError:
     xrange = range  # Python 3
 
+
+# BFS solution.
 class Solution(object):
     def alienOrder(self, words):
         """
@@ -61,6 +63,8 @@ def findEdges(self, word1, word2, in_degree, out_degree):
                 out_degree[word1[i]].add(word2[i])
                 break
 
+
+# DFS solution.
 class Solution2(object):
     def alienOrder(self, words):
         """

Python/all-nodes-distance-k-in-binary-tree.py

@@ -8,6 +8,7 @@
 except NameError:
     xrange = range  # Python 3
 
+
 class Solution(object):
     def distanceK(self, root, target, K):
         """

Python/all-oone-data-structure.py

@@ -11,6 +11,7 @@ def __init__(self, value, keys):
         self.prev = None
         self.next = None
 
+
 class LinkedList(object):
     def __init__(self):
         self.head, self.tail = Node(0, set()), Node(0, set())
@@ -40,6 +41,7 @@ def front(self):
     def back(self):
         return self.tail.prev
 
+
 class AllOne(object):
 
     def __init__(self):

Python/all-possible-full-binary-trees.py

@@ -7,10 +7,11 @@ def __init__(self, x):
         self.left = None
         self.right = None
 
+
 class Solution(object):
     def __init__(self):
         self.__memo = {1: [TreeNode(0)]}
-
+    
     def allPossibleFBT(self, N):
         """
         :type N: int
@@ -31,4 +32,5 @@ def allPossibleFBT(self, N):
             self.__memo[N] = result
 
         return self.__memo[N]
+ 
 

Python/ambiguous-coordinates.py

@@ -8,6 +8,7 @@
 except NameError:
     xrange = range  # Python 3
 
+
 class Solution(object):
     def ambiguousCoordinates(self, S):
         """

Python/android-unlock-patterns.py

@@ -6,6 +6,8 @@
 except NameError:
     xrange = range  # Python 3
 
+
+# DP solution.
 class Solution(object):
     def numberOfPatterns(self, m, n):
         """
@@ -65,6 +67,10 @@ def convert(i, j):
 
         return res
 
+
+# Time:  O(9^2 * 2^9)
+# Space: O(9 * 2^9)
+# DP solution.
 class Solution2(object):
     def numberOfPatterns(self, m, n):
         """
@@ -127,6 +133,10 @@ def convert(i, j):
 
         return res
 
+
+# Time:  O(9!)
+# Space: O(9)
+# Backtracking solution. (TLE)
 class Solution_TLE(object):
     def numberOfPatterns(self, m, n):
         """

Python/arithmetic-slices-ii-subsequence.py

@@ -8,6 +8,7 @@
 except NameError:
     xrange = range  # Python 3
 
+
 class Solution(object):
     def numberOfArithmeticSlices(self, A):
         """

Python/arranging-coins.py

@@ -3,6 +3,7 @@
 
 import math
 
+
 class Solution(object):
     def arrangeCoins(self, n):
         """
@@ -11,6 +12,9 @@ def arrangeCoins(self, n):
         """
         return int((math.sqrt(8*n+1)-1) / 2)  # sqrt is O(logn) time.
 
+
+# Time:  O(logn)
+# Space: O(1)
 class Solution2(object):
     def arrangeCoins(self, n):
         """

Python/array-partition-i.py

@@ -6,6 +6,7 @@
 except NameError:
     xrange = range  # Python 3
 
+
 class Solution(object):
     def arrayPairSum(self, nums):
         """
@@ -22,6 +23,9 @@ def arrayPairSum(self, nums):
             r = (lookup[i-LEFT] + r) % 2
         return result
 
+
+# Time:  O(nlogn)
+# Space: O(1)
 class Solution2(object):
     def arrayPairSum(self, nums):
         """
@@ -34,6 +38,9 @@ def arrayPairSum(self, nums):
             result += nums[i]
         return result
 
+
+# Time:  O(nlogn)
+# Space: O(n)
 class Solution3(object):
     def arrayPairSum(self, nums):
         """

Python/assign-cookies.py

@@ -6,6 +6,7 @@
 except NameError:
     xrange = range  # Python 3
 
+
 class Solution(object):
     def findContentChildren(self, g, s):
         """

Python/asteroid-collision.py

@@ -6,6 +6,7 @@
 except NameError:
     xrange = range  # Python 3
 
+
 class Solution(object):
     def asteroidCollision(self, asteroids):
         """

Python/average-of-levels-in-binary-tree.py

@@ -6,6 +6,7 @@
 except NameError:
     xrange = range  # Python 3
 
+
 class Solution(object):
     def averageOfLevels(self, root):
         """

Python/backspace-string-compare.py

@@ -8,6 +8,7 @@
 except NameError:
     xrange = range  # Python 3
 
+
 class Solution(object):
     def backspaceCompare(self, S, T):
         """

Python/balanced-binary-tree.py

@@ -7,6 +7,7 @@ def __init__(self, x):
         self.left = None
         self.right = None
 
+
 class Solution(object):
     # @param root, a tree node
     # @return a boolean