Merge pull request #8 from chakyam/master

Update

Author: yanglbme

solution/023.Merge k Sorted Lists/Solution.py

@@ -0,0 +1,27 @@
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.next = None
+
+class Solution:
+    def mergeKLists(self, lists):
+        """
+        :type lists: List[ListNode]
+        :rtype: ListNode
+        """
+        list0=[]
+        for i in lists:
+            while i:
+                list0.append(i.val)
+                i=i.next
+        if list0==[]:
+            return []
+        list0.sort(reverse=True)
+        ln=ListNode(0)
+        tmp=ln
+        while list0:
+            tmp1=list0.pop()
+            ln.next=ListNode(tmp1)
+            ln=ln.next
+        return tmp.next

solution/082.Remove Duplicates from Sorted List II/Solution.py

@@ -0,0 +1,35 @@
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.next = None
+
+class Solution:
+    def deleteDuplicates(self, head):
+        """
+        :type head: ListNode
+        :rtype: ListNode
+        """
+        if head == None:
+            return None
+        list0=list()
+        i=head
+        while i:
+            list0.append(i.val)
+            i=i.next
+        list1=list0.copy()
+        for i in list0:
+            c=list0.count(i)
+            if c != 1:            
+                while 1:
+                    try:
+                        list1.remove(i)
+                    except:
+                        break
+        
+        new_listnode=ListNode(0)
+        j=new_listnode
+        for v in list1:
+            new_listnode.next=ListNode(v)
+            new_listnode=new_listnode.next
+        return j.next

solution/083.Remove Duplicates from Sorted List/Solution.py

@@ -0,0 +1,29 @@
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.next = None
+
+class Solution:
+    def deleteDuplicates(self, head):
+        """
+        :type head: ListNode
+        :rtype: ListNode
+        """
+        if head == None:
+            return None
+        dict0=dict()
+        i=head
+        c=0
+        while i:
+            if i.val not in dict0.values():
+                dict0[c]=i.val
+                c+=1
+            i=i.next
+        new_listnode=ListNode(0)
+        j=new_listnode
+        for v in dict0.values():
+            new_listnode.next=ListNode(v)
+            new_listnode=new_listnode.next
+        return j.next
+