update at 2017-09-04

Author: bonfy

001-two-sum/two-sum.js

@@ -10,6 +10,7 @@
 // Because nums[0] + nums[1] = 2 + 7 = 9,
 // return [0, 1].
 //
+//
 
 
 /**

001-two-sum/two-sum.py

@@ -13,6 +13,7 @@
 # Because nums[0] + nums[1] = 2 + 7 = 9,
 # return [0, 1].
 #
+#
 
 
 class Solution(object):

002-add-two-numbers/add-two-numbers.py

@@ -0,0 +1,62 @@
+# -*- coding:utf-8 -*-
+
+
+# You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
+#
+# You may assume the two numbers do not contain any leading zero, except the number 0 itself.
+#
+#
+# Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
+# Output: 7 -> 0 -> 8
+
+
+# Definition for singly-linked list.
+
+# class ListNode(object):
+#     def __init__(self, x):
+#         self.val = x
+#         self.next = None
+
+class Solution(object):
+    def addTwoNumbers(self, l1, l2):
+        """
+        :type l1: ListNode
+        :type l2: ListNode
+        :rtype: ListNode
+        """       
+        if(l1 is None and l2 is None):
+            return None
+
+        head = ListNode(0)
+        point = head
+        carry = 0
+        while l1 is not None and l2 is not None:
+            s = carry + l1.val + l2.val
+            point.next = ListNode(s % 10)
+            carry = s / 10
+            l1 = l1.next
+            l2 = l2.next
+            point = point.next
+            
+        while l1 is not None:
+            s = carry + l1.val
+            point.next = ListNode(s % 10)
+            carry = s / 10
+            l1 = l1.next
+            point = point.next
+        
+        while l2 is not None:
+            s = carry + l2.val
+            point.next = ListNode(s % 10)
+            carry = s / 10
+            l2 = l2.next
+            point = point.next
+    
+        if carry != 0:
+            point.next = ListNode(carry)
+
+        return head.next
+
+        
+        
+        

003-longest-substring-without-repeating-characters/longest-substring-without-repeating-characters.py

@@ -0,0 +1,33 @@
+# -*- coding:utf-8 -*-
+
+
+# Given a string, find the length of the longest substring without repeating characters.
+#
+# Examples:
+#
+# Given "abcabcbb", the answer is "abc", which the length is 3.
+#
+# Given "bbbbb", the answer is "b", with the length of 1.
+#
+# Given "pwwkew", the answer is "wke", with the length of 3. Note that the answer must be a substring, "pwke" is a subsequence and not a substring.
+
+
+class Solution(object):
+    def lengthOfLongestSubstring(self, s):
+        """
+        :type s: str
+        :rtype: int
+        """
+
+        longest, start, visited = 0, 0, [False for _ in range(256)]
+        for ind, val in enumerate(s):
+            if not visited[ord(val)]:
+                visited[ord(val)] = True
+            else:
+                while val != s[start]:
+                    visited[ord(s[start])] = False
+                    start += 1
+                start += 1
+            longest = max(longest, ind - start + 1)
+        return longest
+        

004-median-of-two-sorted-arrays/median-of-two-sorted-arrays.py

@@ -21,6 +21,7 @@
 #
 # The median is (2 + 3)/2 = 2.5
 #
+#
 
 
 class Solution(object):

005-longest-palindromic-substring/longest-palindromic-substring.py

@@ -19,6 +19,7 @@
 #
 # Output: "bb"
 #
+#
 
 
 class Solution(object):

006-zigzag-conversion/zigzag-conversion.py

@@ -16,7 +16,8 @@
 #
 # string convert(string text, int nRows);
 #
-# convert("PAYPALISHIRING", 3) should return "PAHNAPLSIIGYIR".
+# convert("PAYPALISHIRING", 3) should return "PAHNAPLSIIGYIR".
+#
 
 
 class Solution(object):

007-reverse-integer/reverse-integer.py

@@ -25,7 +25,8 @@
 #
 #
 # Note:
-# The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.
+# The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.
+#
 
 
 class Solution(object):

008-string-to-integer-atoi/string-to-integer-atoi.py

@@ -26,6 +26,7 @@
 #
 # If no valid conversion could be performed, a zero value is returned. If the correct value is out of the range of representable values, INT_MAX (2147483647) or INT_MIN (-2147483648) is returned.
 #
+#
 
 
 class Solution(object):

009-palindrome-number/palindrome-number.py

@@ -15,6 +15,7 @@
 #
 # There is a more generic way of solving this problem.
 #
+#
 
 
 class Solution(object):