update

Author: kamyu104

Python/candy.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(n)
 # Space: O(n)
 
@@ -20,8 +19,3 @@ def candy(self, ratings):
 
         return reduce(operator.add, candies)
 
-if __name__ == "__main__":
-    result = Solution().candy([1, 2, 3, 2, 3, 5, 2, 5])
-    print(result)
-
-

Python/climbing-stairs.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(n)
 # Space: O(1)
 
@@ -22,7 +21,3 @@ def climbStairs1(self, n):
             return 2
         return self.climbStairs(n - 1) + self.climbStairs(n - 2)
 
-if __name__ == "__main__":
-    result = Solution().climbStairs(2)
-    print(result)
-

Python/combination-sum-ii.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(k * C(n, k))
 # Space: O(k)
 
@@ -23,8 +22,3 @@ def combinationSumRecu(self, candidates, result, start, intermediate, target):
                 prev = candidates[start]
             start += 1
 
-if __name__ == "__main__":
-    candidates, target = [10, 1, 2, 7, 6, 1, 5], 8
-    result = Solution().combinationSum2(candidates, target)
-    print(result)
-

Python/combination-sum.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(k * n^k)
 # Space: O(k)
 
@@ -20,8 +19,3 @@ def combinationSumRecu(self, candidates, result, start, intermediate, target):
             intermediate.pop()
             start += 1
 
-if __name__ == "__main__":
-    candidates, target = [2, 3, 6, 7], 7
-    result = Solution().combinationSum(candidates, target)
-    print(result)
-

Python/combinations.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(k * C(n, k))
 # Space: O(k)
 
@@ -46,7 +45,3 @@ def combineDFS(n, start, intermediate, k, result):
         return result
 
 
-if __name__ == "__main__":
-    result = Solution().combine(4, 2)
-    print(result)
-

Python/compare-version-numbers.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(n)
 # Space: O(1)
 
@@ -83,8 +82,3 @@ def compareVersion4(self, version1, version2):
         return cmp(int(main1), int(main2)) or len(rest1 + rest2) and self.compareVersion4(rest1, rest2)
 
 
-if __name__ == "__main__":
-    print(Solution().compareVersion("21.0", "121.1.0"))
-    print(Solution().compareVersion("01", "1"))
-    print(Solution().compareVersion("1", "1.0"))
-

Python/construct-binary-tree-from-inorder-and-postorder-traversal.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(n)
 # Space: O(n)
 
@@ -27,11 +26,3 @@ def buildTreeRecu(self, lookup, postorder, inorder, post_end, in_start, in_end):
         node.right = self.buildTreeRecu(lookup, postorder, inorder, post_end - 1, i + 1, in_end)
         return node
 
-if __name__ ==  "__main__":
-    inorder = [2, 1, 3]
-    postorder = [2, 3, 1]
-    result = Solution().buildTree(inorder, postorder)
-    print(result.val)
-    print(result.left.val)
-    print(result.right.val)
-

Python/construct-binary-tree-from-preorder-and-inorder-traversal.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(n)
 # Space: O(n)
 
@@ -27,11 +26,3 @@ def buildTreeRecu(self, lookup, preorder, inorder, pre_start, in_start, in_end):
         node.right = self.buildTreeRecu(lookup, preorder, inorder, pre_start + 1 + i - in_start, i + 1, in_end)
         return node
 
-if __name__ ==  "__main__":
-    preorder = [1, 2, 3]
-    inorder = [2, 1, 3]
-    result = Solution().buildTree(preorder, inorder)
-    print(result.val)
-    print(result.left.val)
-    print(result.right.val)
-

Python/container-with-most-water.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(n)
 # Space: O(1)
 
@@ -14,8 +13,3 @@ def maxArea(self, height):
                 j -= 1
         return max_area
 
-if __name__ == "__main__":
-    height = [1, 2, 3, 4, 3, 2, 1, 5]
-    result = Solution().maxArea(height)
-    print(result)
-

Python/convert-sorted-array-to-binary-search-tree.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(n)
 # Space: O(logn)
 
@@ -43,10 +42,3 @@ def perfect_tree_pivot(self, n):
                                # has more nodes and the right subtree is perfect.
 
 
-if __name__ == "__main__":
-    num = [1, 2, 3]
-    result = Solution().sortedArrayToBST(num)
-    print(result.val)
-    print(result.left.val)
-    print(result.right.val)
-