cxxpython9
diff --git a/‎.idea/AlgorithmsByPython.iml‎
Lines changed: 1 addition & 1 deletion b/‎.idea/AlgorithmsByPython.iml‎
Lines changed: 1 addition & 1 deletion
diff --git a/‎.idea/misc.xml‎
Lines changed: 1 addition & 1 deletion b/‎.idea/misc.xml‎
Lines changed: 1 addition & 1 deletion
diff --git a/‎.idea/workspace.xml‎
Lines changed: 76 additions & 51 deletions b/‎.idea/workspace.xml‎
Lines changed: 76 additions & 51 deletions
diff --git a/‎leetcode/19. Remove Nth Node From End of List.py‎
Lines changed: 28 additions & 0 deletions b/‎leetcode/19. Remove Nth Node From End of List.py‎
Lines changed: 28 additions & 0 deletions
diff --git a/‎leetcode/2. Add Two Numbers.py‎
Lines changed: 26 additions & 0 deletions b/‎leetcode/2. Add Two Numbers.py‎
Lines changed: 26 additions & 0 deletions
diff --git a/‎leetcode/203. Remove Linked List Elements.py‎
Lines changed: 26 additions & 0 deletions b/‎leetcode/203. Remove Linked List Elements.py‎
Lines changed: 26 additions & 0 deletions
@@ -0,0 +1,28 @@
+'''
+Given a linked list, remove the nth node from the end of list and return its head.
+For example,
+   Given linked list: 1->2->3->4->5, and n = 2.
+   After removing the second node from the end, the linked list becomes 1->2->3->5.
+'''
+class ListNode(object):
+    def __init__(self, x):
+        self.val = x
+        self.next = None
+
+class Solution(object):
+    def removeNthFromEnd(self, head, n):
+        if not head and n <= 0:
+            return None
+        pNode = ListNode(0)
+        pNode.next = head
+        first, second = pNode, pNode
+        for i in range(n):
+            if first.next:
+                first = first.next
+            else:
+                return None
+        while first.next:
+            first = first.next
+            second = second.next
+        second.next = second.next.next
+        return pNode.next
@@ -0,0 +1,26 @@
+'''
+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
+'''
+class ListNode(object):
+    def __init__(self, x):
+        self.val = x
+        self.next = None
+
+class Solution(object):
+    def addTwoNumbers(self, l1, l2):
+        pNode = ListNode(0)
+        pHead = pNode
+        val = 0
+        while l1 or l2 or val:
+            if l1:
+                val += l1.val
+                l1 = l1.next
+            if l2:
+                val += l2.val
+                l2 = l2.next
+            pNode.next = ListNode(val % 10)
+            val /= 10
+            pNode = pNode.next
+        return pHead.next
@@ -0,0 +1,26 @@
+'''
+Remove all elements from a linked list of integers that have value val.
+Example
+Given: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6
+Return: 1 --> 2 --> 3 --> 4 --> 5
+'''
+# Definition for singly-linked list.
+class ListNode(object):
+    def __init__(self, x):
+        self.val = x
+        self.next = None
+
+class Solution(object):
+    
+    def removeElements(self, head, val):
+        preNode, res = None, head
+        while head:
+            if head.val == val:
+                if not preNode:
+                    res = res.next
+                else:
+                    preNode.next = head.next
+            else:
+                preNode = head
+            head = head.next
+        return res