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)
-

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

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(n)
 # Space: O(logn)
 
@@ -36,12 +35,3 @@ def sortedListToBSTRecu(self, start, end):
         current.right = self.sortedListToBSTRecu(mid + 1, end)
         return current
 
-if __name__ == "__main__":
-    head = ListNode(1)
-    head.next = ListNode(2)
-    head.next.next = ListNode(3)
-    result = Solution().sortedListToBST(head)
-    print(result.val)
-    print(result.left.val)
-    print(result.right.val)
-

Python/copy-list-with-random-pointer.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(n)
 # Space: O(1)
 
@@ -60,12 +59,3 @@ def copyRandomList(self, head):
         return dummy.next
 
 
-if __name__ == "__main__":
-    head = RandomListNode(1)
-    head.next = RandomListNode(2)
-    head.random = head.next
-    result = Solution().copyRandomList(head)
-    print(result.label)
-    print(result.next.label)
-    print(result.random.label)
-

Python/count-and-say.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(n * 2^n)
 # Space: O(2^n)
 
@@ -21,9 +20,3 @@ def getNext(self, seq):
             i += 1
         return next_seq
 
-if __name__ == "__main__":
-    for i in xrange(1, 4):
-        print(Solution().countAndSay(i))
-
-
-

Python/counting-bits.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(n)
 # Space: O(n)
 
@@ -25,8 +24,3 @@ def countBits2(self, num):
         return s[:num + 1]
 
 
-if __name__ == '__main__':
-    s = Solution()
-    r = s.countBits2(5)
-    print(r)
-

Python/course-schedule.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(|V| + |E|)
 # Space: O(|E|)
 
@@ -42,6 +41,3 @@ def canFinish(self, numCourses, prerequisites):
         return True
 
 
-if __name__ == "__main__":
-    print(Solution().canFinish(1, []))
-

Python/decode-ways.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(n)
 # Space: O(1)
 
@@ -21,7 +20,3 @@ def numDecodings(self, s):
         return prev
 
 
-if __name__ == "__main__":
-    for i in ["0", "10", "10", "103", "1032", "10323"]:
-        print(Solution().numDecodings(i))
-

Python/distinct-subsequences.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(n^2)
 # Space: O(n)
 
@@ -13,10 +12,3 @@ def numDistinct(self, S, T):
                     ways[j + 1] += ways[j]
         return ways[len(T)]
 
-if __name__ == "__main__":
-    S = "rabbbit"
-    T = "rabbit"
-    result = Solution().numDistinct(S, T)
-    print(result)
-
-

Python/divide-two-integers.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(logn) = O(1)
 # Space: O(1)
 
@@ -43,9 +42,3 @@ def divide2(self, dividend, divisor):
             res = -res
         return min(max(-2147483648, res), 2147483647)
 
-if __name__ == "__main__":
-    print(Solution().divide(123, 12))
-    print(Solution().divide(123, -12))
-    print(Solution().divide(-123, 12))
-    print(Solution().divide(-123, -12))
-

Python/dungeon-game.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(m * n)
 # Space: O(m + n)
 
@@ -65,15 +64,3 @@ def DP(self, dungeon, HP):
 
         return remain_HP[-1] > 0
 
-if __name__ == "__main__":
-    dungeon = [[ -2,  -3,  3], \
-               [ -5, -10,  1], \
-               [ 10,  30, -5]]
-    print(Solution().calculateMinimumHP(dungeon))
-
-    dungeon = [[ -200]]
-    print(Solution().calculateMinimumHP(dungeon))
-
-    dungeon = [[0, -3]]
-    print(Solution().calculateMinimumHP(dungeon))
-

Python/edit-distance.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(n * m)
 # Space: O(n + m)
 
@@ -43,8 +42,3 @@ def minDistance(self, word1, word2):
 
         return distance[-1][-1]
 
-if __name__ == "__main__":
-    print(Solution().minDistance("Rabbit", "Racket"))
-    print(Solution2().minDistance("Rabbit", "Rabket"))
-    print(Solution().minDistance("Rabbit", "Rabbitt"))
-

Python/evaluate-reverse-polish-notation.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(n)
 # Space: O(n)
 
@@ -17,8 +16,3 @@ def evalRPN(self, tokens):
                 numerals.append(int(operators[token](x * 1.0, y)))
         return numerals.pop()
 
-if __name__ == "__main__":
-    print(Solution().evalRPN(["2", "1", "+", "3", "*"]))
-    print(Solution().evalRPN(["4", "13", "5", "/", "+"]))
-    print(Solution().evalRPN(["10","6","9","3","+","-11","*","/","*","17","+","5","+"]))
-

Python/excel-sheet-column-number.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(n)
 # Space: O(1)
 
@@ -15,6 +14,3 @@ def titleToNumber(self, s):
         return result
 
 
-if __name__ == "__main__":
-    print(Solution().titleToNumber("AAAB"))
-

Python/excel-sheet-column-title.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(logn)
 # Space: O(1)
 
@@ -17,7 +16,3 @@ def convertToTitle(self, n):
         return result[::-1]
 
 
-if __name__ == "__main__":
-    for i in xrange(1, 29):
-        print(Solution().convertToTitle(i))
-

Python/factorial-trailing-zeroes.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(logn) = O(1)
 # Space: O(1)
 
@@ -11,6 +10,3 @@ def trailingZeroes(self, n):
             n /= 5
         return result
 
-if __name__ == "__main__":
-    print(Solution().trailingZeroes(100))
-

Python/find-all-numbers-disappeared-in-an-array.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(n)
 # Space: O(1)
 
@@ -35,8 +34,3 @@ def findDisappearedNumbers3(self, nums):
         return [i + 1 for i in range(len(nums)) if nums[i] > 0]
 
 
-if __name__ == '__main__':
-    s = Solution()
-    r = s.findDisappearedNumbers([4, 3, 2, 7, 8, 2, 3, 1])
-    print(r)
-

Python/find-minimum-in-rotated-sorted-array-ii.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(logn) ~ O(n)
 # Space: O(1)
 
@@ -42,7 +41,3 @@ def findMin(self, nums):
         return nums[left]
 
 
-if __name__ == "__main__":
-    print(Solution().findMin([3, 1, 1, 2, 2, 3]))
-    print(Solution2().findMin([2, 2, 2, 3, 3, 1]))
-

Python/find-minimum-in-rotated-sorted-array.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 # Time:  O(logn)
 # Space: O(1)
 
@@ -40,10 +39,3 @@ def findMin(self, nums):
         return nums[left]
 
 
-if __name__ == "__main__":
-    print(Solution().findMin([1]))
-    print(Solution().findMin([1, 2]))
-    print(Solution().findMin([2, 1]))
-    print(Solution().findMin([3, 1, 2]))
-    print(Solution().findMin([2, 3, 1]))
-