update

Author: kamyu104

Python/3sum-smaller.py

@@ -1,7 +1,7 @@
 # Time:  O(n^2)
 # Space: O(1)
 
-class Solution:
+class Solution(object):
     # @param {integer[]} nums
     # @param {integer} target
     # @return {integer}

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

@@ -1,14 +1,14 @@
 # Time:  O(min(n, h)), per operation
 # Space: O(min(n, h))
 
-class TrieNode:
+class TrieNode(object):
     # Initialize your data structure here.
     def __init__(self):
         self.is_string = False
         self.leaves = {}
 
 
-class WordDictionary:
+class WordDictionary(object):
     def __init__(self):
         self.root = TrieNode()
 

Python/add-binary.py

@@ -2,7 +2,7 @@
 # Space: O(1)
 
 
-class Solution:
+class Solution(object):
     # @param a, a string
     # @param b, a string
     # @return a string

Python/add-two-numbers.py

@@ -1,7 +1,7 @@
 # Time:  O(n)
 # Space: O(1)
 
-class ListNode:
+class ListNode(object):
     def __init__(self, x):
         self.val = x
         self.next = None

Python/basic-calculator-ii.py

@@ -2,7 +2,7 @@
 # Space: O(n)
 
 
-class Solution:
+class Solution(object):
     # @param {string} s
     # @return {integer}
     def calculate(self, s):

Python/basic-calculator-iv.py

@@ -10,7 +10,7 @@
 import itertools
 
 
-class Poly(collections.Counter):
+class Poly(collections.Counter)(object):
     def __init__(self, expr=None):
         if expr is None:
             return

Python/basic-calculator.py

@@ -2,7 +2,7 @@
 # Space: O(n)
 
 
-class Solution:
+class Solution(object):
     # @param {string} s
     # @return {integer}
     def calculate(self, s):

Python/best-time-to-buy-and-sell-stock-ii.py

@@ -2,7 +2,7 @@
 # Space: O(1)
 
 
-class Solution:
+class Solution(object):
     # @param prices, a list of integer
     # @return an integer
     def maxProfit(self, prices):

Python/candy.py

@@ -4,7 +4,7 @@
 import operator
 from functools import reduce
 
-class Solution:
+class Solution(object):
     # @param ratings, a list of integer
     # @return an integer
     def candy(self, ratings):

Python/climbing-stairs.py

@@ -1,7 +1,7 @@
 # Time:  O(n)
 # Space: O(1)
 
-class Solution:
+class Solution(object):
     """
     :type n: int
     :rtype: int

Python/clone-graph.py

@@ -1,12 +1,12 @@
 # Time:  O(n)
 # Space: O(n)
 
-class UndirectedGraphNode:
+class UndirectedGraphNode(object):
     def __init__(self, x):
         self.label = x
         self.neighbors = []
 
-class Solution:
+class Solution(object):
     # @param node, a undirected graph node
     # @return a undirected graph node
     def cloneGraph(self, node):

Python/combination-sum-ii.py

@@ -1,7 +1,7 @@
 # Time:  O(k * C(n, k))
 # Space: O(k)
 
-class Solution:
+class Solution(object):
     # @param candidates, a list of integers
     # @param target, integer
     # @return a list of lists of integers

Python/combination-sum-iii.py

@@ -1,7 +1,7 @@
 # Time:  O(k * C(n, k))
 # Space: O(k)
 
-class Solution:
+class Solution(object):
     # @param {integer} k
     # @param {integer} n
     # @return {integer[][]}

Python/combination-sum.py

@@ -1,7 +1,7 @@
 # Time:  O(k * n^k)
 # Space: O(k)
 
-class Solution:
+class Solution(object):
     # @param candidates, a list of integers
     # @param target, integer
     # @return a list of lists of integers

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

@@ -1,13 +1,13 @@
 # Time:  O(n)
 # Space: O(n)
 
-class TreeNode:
+class TreeNode(object):
     def __init__(self, x):
         self.val = x
         self.left = None
         self.right = None
 
-class Solution:
+class Solution(object):
     # @param inorder, a list of integers
     # @param postorder, a list of integers
     # @return a tree node

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

@@ -1,13 +1,13 @@
 # Time:  O(n)
 # Space: O(n)
 
-class TreeNode:
+class TreeNode(object):
     def __init__(self, x):
         self.val = x
         self.left = None
         self.right = None
 
-class Solution:
+class Solution(object):
     # @param preorder, a list of integers
     # @param inorder, a list of integers
     # @return a tree node

Python/container-with-most-water.py

@@ -1,7 +1,7 @@
 # Time:  O(n)
 # Space: O(1)
 
-class Solution:
+class Solution(object):
     # @return an integer
     def maxArea(self, height):
         max_area, i, j = 0, 0, len(height) - 1

Python/contains-duplicate-ii.py

@@ -1,7 +1,7 @@
 # Time:  O(n)
 # Space: O(n)
 
-class Solution:
+class Solution(object):
     # @param {integer[]} nums
     # @param {integer} k
     # @return {boolean}

Python/contains-duplicate-iii.py

@@ -4,7 +4,7 @@
 import collections
 
 
-class Solution:
+class Solution(object):
     # @param {integer[]} nums
     # @param {integer} k
     # @param {integer} t

Python/contains-duplicate.py

@@ -1,7 +1,7 @@
 # Time:  O(n)
 # Space: O(n)
 
-class Solution:
+class Solution(object):
     # @param {integer[]} nums
     # @return {boolean}
     def containsDuplicate(self, nums):

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

@@ -1,7 +1,7 @@
 # Time:  O(n)
 # Space: O(logn)
 
-class TreeNode:
+class TreeNode(object):
     def __init__(self, x):
         self.val = x
         self.left = None

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

@@ -1,19 +1,19 @@
 # Time:  O(n)
 # Space: O(logn)
 
-class TreeNode:
+class TreeNode(object):
     def __init__(self, x):
         self.val = x
         self.left = None
         self.right = None
 #
 # Definition for singly-linked list.
-class ListNode:
+class ListNode(object):
     def __init__(self, x):
         self.val = x
         self.next = None
 
-class Solution:
+class Solution(object):
     head = None
     # @param head, a list node
     # @return a tree node

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

@@ -1,13 +1,13 @@
 # Time:  O(n)
 # Space: O(1)
 
-class RandomListNode:
+class RandomListNode(object):
     def __init__(self, x):
         self.label = x
         self.next = None
         self.random = None
 
-class Solution:
+class Solution(object):
     # @param head, a RandomListNode
     # @return a RandomListNode
     def copyRandomList(self, head):
@@ -37,7 +37,7 @@ def copyRandomList(self, head):
 
 # Time:  O(n)
 # Space: O(n)
-class Solution2:
+class Solution2(object):
     # @param head, a RandomListNode
     # @return a RandomListNode
     def copyRandomList(self, head):

Python/count-and-say.py

@@ -1,7 +1,7 @@
 # Time:  O(n * 2^n)
 # Space: O(2^n)
 
-class Solution:
+class Solution(object):
     # @return a string
     def countAndSay(self, n):
         seq = "1"

Python/count-complete-tree-nodes.py

@@ -1,7 +1,7 @@
 # Time:  O(h * logn) = O((logn)^2)
 # Space: O(1)
 
-class Solution:
+class Solution(object):
     # @param {TreeNode} root
     # @return {integer}
     def countNodes(self, root):

Python/count-primes.py

@@ -1,7 +1,7 @@
 # Time:  O(n)
 # Space: O(n)
 
-class Solution:
+class Solution(object):
     # @param {integer} n
     # @return {integer}
     def countPrimes(self, n):

Python/count-univalue-subtrees.py

@@ -1,7 +1,7 @@
 # Time:  O(n)
 # Space: O(h)
 
-class Solution:
+class Solution(object):
     # @param {TreeNode} root
     # @return {integer}
     def countUnivalSubtrees(self, root):

Python/delete-node-in-a-linked-list.py

@@ -1,7 +1,7 @@
 # Time:  O(1)
 # Space: O(1)
 
-class Solution:
+class Solution(object):
     # @param {ListNode} node
     # @return {void} Do not return anything, modify node in-place instead.
     def deleteNode(self, node):

Python/design-linked-list.py

@@ -1,7 +1,7 @@
 # Time:  O(n)
 # Space: O(n)
 
-class Node:
+class Node(object):
     def __init__(self, value):
         self.val = value
         self.next = self.prev = None

Python/different-ways-to-add-parentheses.py

@@ -8,7 +8,7 @@
 import re
 
 
-class Solution:
+class Solution(object):
     # @param {string} input
     # @return {integer[]}
     def diffWaysToCompute(self, input):
@@ -30,7 +30,7 @@ def diffWaysToComputeRecu(left, right):
 
         return diffWaysToComputeRecu(0, len(nums) - 1)
 
-class Solution2:
+class Solution2(object):
     # @param {string} input
     # @return {integer[]}
     def diffWaysToCompute(self, input):

Python/distinct-subsequences.py

@@ -1,7 +1,7 @@
 # Time:  O(n^2)
 # Space: O(n)
 
-class Solution:
+class Solution(object):
     # @return an integer
     def numDistinct(self, S, T):
         ways = [0 for _ in xrange(len(T) + 1)]

Python/divide-two-integers.py

@@ -1,7 +1,7 @@
 # Time:  O(logn) = O(1)
 # Space: O(1)
 
-class Solution:
+class Solution(object):
     def divide(self, dividend, divisor):
         """
         :type dividend: int

Python/dungeon-game.py

@@ -1,7 +1,7 @@
 # Time:  O(m * n)
 # Space: O(m + n)
 
-class Solution:
+class Solution(object):
     # @param dungeon, a list of lists of integers
     # @return a integer
     def calculateMinimumHP(self, dungeon):
@@ -18,7 +18,7 @@ def calculateMinimumHP(self, dungeon):
 
 # Time:  O(m * n logk), where k is the possible maximum sum of loses
 # Space: O(m + n)
-class Solution2:
+class Solution2(object):
     # @param dungeon, a list of lists of integers
     # @return a integer
     def calculateMinimumHP(self, dungeon):

Python/edit-distance.py

@@ -1,7 +1,7 @@
 # Time:  O(n * m)
 # Space: O(n + m)
 
-class Solution:
+class Solution(object):
     # @return an integer
     def minDistance(self, word1, word2):
         if len(word1) < len(word2):
@@ -25,7 +25,7 @@ def minDistance(self, word1, word2):
 
 # Time:  O(n * m)
 # Space: O(n * m)
-class Solution2:
+class Solution2(object):
     # @return an integer
     def minDistance(self, word1, word2):
         distance = [[i] for i in xrange(len(word1) + 1)]

Python/encode-and-decode-strings.py

@@ -1,7 +1,7 @@
 # Time:  O(n)
 # Space: O(1)
 
-class Codec:
+class Codec(object):
 
     def encode(self, strs):
         """Encodes a list of strings to a single string.