Merge pull request doocs#101 from zhanary/master

 Update Solution to 026[python2] - 48ms

Author: yanglbme

solution/021.Merge Two Sorted Lists/Solution2.py

@@ -0,0 +1,19 @@
+# Definition for singly-linked list.
+# class ListNode(object):
+#     def __init__(self, x):
+#         self.val = x
+#         self.next = None
+
+#经典的merge，每次都比较两个链表的第一个数字
+#递归的方法
+class Solution(object):
+    def mergeTwoLists(self, l1, l2):
+        if not l1 or not l2:
+            return l1 or l2
+        if l1.val < l2.val:   #输出较小的一个
+            l1.next = self.mergeTwoLists(l1.next, l2)
+            return l1
+        else :
+            l2.next = self.mergeTwoLists(l1, l2.next)
+            return l2
+

solution/026.Remove Duplicates from Sorted Array/Solution.py

@@ -0,0 +1,14 @@
+#48ms
+class Solution(object):
+    def removeDuplicates(self, nums):
+        if not nums:
+            return 0
+        
+        newtail = 0
+        
+        for i in range(1, len(nums)):
+            if nums[i] != nums[newtail]:
+                newtail += 1
+                nums[newtail] = nums[i] #只要求字符串前段正确即可
+                
+        return newtail + 1   #要求返回新字符串长度