nature1995
diff --git a/‎.gitignore
Copy file name to clipboardExpand all lines: .gitignore
+2Lines changed: 2 additions & 0 deletions b/‎.gitignore
Copy file name to clipboardExpand all lines: .gitignore
+2Lines changed: 2 additions & 0 deletions
diff --git a/‎Python3/001 Two Sum.py
Copy file name to clipboardExpand all lines: Python3/001 Two Sum.py b/‎Python3/001 Two Sum.py
Copy file name to clipboardExpand all lines: Python3/001 Two Sum.py
diff --git a/‎Python3/001_Two_Sum.py
Copy file name to clipboard
+34Lines changed: 34 additions & 0 deletions b/‎Python3/001_Two_Sum.py
Copy file name to clipboard
+34Lines changed: 34 additions & 0 deletions
diff --git a/‎Python3/002_Add_Two_Numbers.py
Copy file name to clipboard
+60Lines changed: 60 additions & 0 deletions b/‎Python3/002_Add_Two_Numbers.py
Copy file name to clipboard
+60Lines changed: 60 additions & 0 deletions
@@ -56,3 +56,5 @@ docs/_build/
 
 # PyBuilder
 target/
+
+\.idea/
@@ -0,0 +1,34 @@
+'''
+Given an array of integers, find two numbers such that they add up to a specific target number.
+
+The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
+
+You may assume that each input would have exactly one solution.
+
+Input: numbers={2, 7, 11, 15}, target=9
+Output: index1=1, index2=2
+'''
+
+
+class Solution(object):
+    def twoSum(self, nums, target):
+        """
+        :type nums: List[int]
+        :type target: int
+        :rtype: List[int]
+        """
+        dist = {}
+        for index, value in enumerate(nums):
+            dist[value] = index
+        for index1, value in enumerate(nums):
+            if target - value in dist:
+                index2 = dist[target - value]
+                if index1 != index2:
+                    return  [index1+1, index2+1]
+
+
+if __name__ == '__main__':
+    print(Solution().twoSum([2, 7, 11, 15], 9))
+
+
+
@@ -0,0 +1,60 @@
+'''
+You are given two linked lists representing two non-negative numbers. 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.
+
+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
+
+    # Define this to check if it works well
+    def myPrint(self):
+        print(self.val)
+        if self.next:
+            self.next.myPrint()
+
+
+class Solution(object):
+    def addTwoNumbers(self, l1, l2):
+        """
+        :type l1: ListNode
+        :type l2: ListNode
+        :rtype: ListNode
+        """
+        result = ListNode(0);
+        cur = result;
+        while l1 or l2:
+            cur.val += self.addTwoNodes(l1, l2)
+            if cur.val >= 10:
+                cur.val -= 10
+                cur.next = ListNode(1)
+            else:
+                # Check if there is need to make the next node
+                if l1 and l1.next or l2 and l2.next:
+                    cur.next = ListNode(0)
+            cur = cur.next
+            if l1:
+                l1 = l1.next
+            if l2:
+                l2 = l2.next
+        return result
+
+    def addTwoNodes(self, n1, n2):
+        if not n1 and not n2:
+            # This cannot happen, ignore it
+            None
+        if not n1:
+            return n2.val
+        if not n2:
+            return n1.val
+        return n1.val + n2.val
+
+
+if __name__ == "__main__":
+    list = ListNode(9)
+    list.next = ListNode(8)
+    print(Solution().addTwoNumbers(list, ListNode(1)).myPrint())