Merge pull request #183 from frank731/master

Added Add Two Numbers II and Queue Reconstruction by Height

Author: larissalages

leetcode/python/linked_lists/add_two_numbers_II.py

@@ -0,0 +1,22 @@
+class Solution:
+    def linkedListToInt(self, list_node, integer):
+        integer += str(list_node.val)
+        if list_node.next == None:
+            return int(integer)
+        else:
+            return self.linkedListToInt(list_node.next, integer)
+
+    def intToLinkedList(self, integer):
+        integer = str(integer)
+        print(integer)
+        ll = [ListNode(int(integer[0]))]
+        for i in range(1, len(integer)):
+            ll.append(ListNode(int(integer[i])))
+            ll[i - 1].next = ll[i]
+        return ll[0]
+
+    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
+        first = self.linkedListToInt(l1, "")
+        second = self.linkedListToInt(l2, "")
+        summed = first + second
+        return self.intToLinkedList(summed)

leetcode/python/queue_reconstruction_by_height.py

@@ -0,0 +1,7 @@
+class Solution:
+    def reconstructQueue(self, people: List[List[int]]) -> List[List[int]]:
+        people.sort(key=lambda person: (-person[0], person[1]))
+        sorted_queue = []
+        for person in people:
+            sorted_queue.insert(person[1], person)
+        return sorted_queue