leetcode 1-3 26

Author: imbaliking

new_issue/lengthOfLongestSubstring.py

@@ -0,0 +1,20 @@
+
+def lengthOfLongestSubstring(s):
+    ret_length = 0
+    length = len(s)
+    dupstring = set()
+    rk = -1
+    for i in range(length):
+        if i > 0:
+            dupstring.remove(s[i-1])
+        while rk+1 < length and s[rk+1] not in dupstring:
+            dupstring.add(s[rk+1])
+            rk += 1
+        ret_length = max(ret_length,rk-i+1)
+    return ret_length
+
+if __name__ == "__main__":
+    test_string = "pwwakew"
+    print lengthOfLongestSubstring(test_string)
+
+

new_issue/removeDuplicates.py

@@ -0,0 +1,21 @@
+class Solution(object):
+    def removeDuplicates(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: int
+        """
+        if len(nums) == 0:
+            return 0
+
+        slow = 1
+        for index in range(1,len(nums)):
+            if nums[index] != nums[index-1]:
+                nums[slow] = nums[index]
+                slow += 1
+        return slow
+
+if __name__ == "__main__":
+    test_list = [0,0,1,1,1,2,2,3,3,4,4]
+    sol = Solution()
+    new_length = sol.removeDuplicates(test_list)
+    print new_length,test_list[:new_length]

new_issue/two_sum.py

@@ -0,0 +1,18 @@
+def twoSum(nums, target):
+    """
+    :type nums: List[int]
+    :type target: int
+    :rtype: List[int]
+    """
+
+    new_dict = {}
+    for i,item in enumerate(nums):
+        if target - item in new_dict:
+            return [i,new_dict[target - item]]
+        new_dict[nums[i]] = i
+
+
+if __name__ == "__main__":
+    nums = [2,7,11,15]
+    target = 9
+    print twoSum(nums,target)

new_issue/two_sum_listnode.py

@@ -0,0 +1,56 @@
+class ListNode(object):
+    def __init__(self, val=0, next=None):
+        self.val = val
+        self.next = next
+
+def addTwoNumbers(l1, l2):
+    """
+    :type l1: ListNode
+    :type l2: ListNode
+    :rtype: ListNode
+    """
+    if l1.val == 0 and l1.next is None:
+        return l2
+    if l2.val == 0 and l2.next is None:
+        return l1
+
+    ret = ListNode((l1.val+l2.val)%10)
+    last = ret
+    advance = l1.val+l2.val >= 10
+    l1 = l1.next
+    l2 = l2.next
+    while l1 is not None or l2 is not None:
+        num1 = l1.val if l1 is not None else 0
+        num2 = l2.val if l2 is not None else 0
+        sum = num1 + num2
+        if advance:
+            sum += 1
+        advance = sum >= 10
+        new_node = ListNode(sum%10)
+        last.next = new_node
+        last = new_node
+        l1 = l1.next if l1 is not None else None
+        l2 = l2.next if l2 is not None else None
+    if advance:
+        last.next = ListNode(1)
+    return ret
+
+if __name__ == "__main__":
+    l1 = [0]
+    l2 = [5, 6, 4]
+    test1 = ListNode(l1[0])
+    last1 = test1
+    test2 = ListNode(l2[0])
+    last2 = test2
+    for item in l1[1:]:
+        new_node = ListNode(item)
+        last1.next = new_node
+        last1 = new_node
+    for item in l2[1:]:
+        new_node = ListNode(item)
+        last2.next = new_node
+        last2 = new_node
+    ret = addTwoNumbers(test1,test2)
+    while ret is not None:
+        print ret.val
+        ret = ret.next