07/12/2020

Author: jameszu

Daily-challenge/Dec/06/README.md

@@ -39,30 +39,31 @@ yea ill ttyl
 ## Code
 ```python
 
-# Definition for singly-linked list.
-# class ListNode:
-#     def __init__(self, val=0, next=None):
-#         self.val = val
-#         self.next = next
+"""
+# Definition for a Node.
+class Node:
+    def __init__(self, val: int = 0, left: 'Node' = None, right: 'Node' = None, next: 'Node' = None):
+        self.val = val
+        self.left = left
+        self.right = right
+        self.next = next
+"""
+
 class Solution:
-    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
-        s1, s2 = [], []
-        while l1:
-            s1.append(l1.val)
-            l1 = l1.next
-        
-        while l2:
-            s2.append(l2.val)
-            l2 = l2.next
-            
-        carry = 0
-        head = ListNode(0)
-        while s1 or s2 or carry:
-            if s1:
-                carry += s1.pop()
-            if s2:
-                carry += s2.pop()
-            carry, val = divmod(carry, 10)
-            head.next, head.next.next = ListNode(val), head.next
-        return head.next
+    def connect(self, root: 'Node') -> 'Node':
+        node = root
+        while node:
+            cur = dummy = Node(0)
+            while node:
+                if node.left:
+                    cur.next = node.left
+                    cur = cur.next
+                    
+                if node.right:
+                    cur.next = node.right
+                    cur = cur.next
+                    
+                node = node.next
+            node = dummy.next
+        return root
 ```

Daily-challenge/Dec/06/sol.py

@@ -1,11 +1,27 @@
+"""
+# Definition for a Node.
+class Node:
+    def __init__(self, val: int = 0, left: 'Node' = None, right: 'Node' = None, next: 'Node' = None):
+        self.val = val
+        self.left = left
+        self.right = right
+        self.next = next
+"""
+
 class Solution:
-    def minCostToMoveChips(self, position: List[int]) -> int:
-        eve = 0
-        odd = 0
-        for i in position:
-            if i % 2 == 0:
-                eve += 1
-            else:
-                odd += 1
-                
-        return min(eve, odd)
+    def connect(self, root: 'Node') -> 'Node':
+        node = root
+        while node:
+            cur = dummy = Node(0)
+            while node:
+                if node.left:
+                    cur.next = node.left
+                    cur = cur.next
+                    
+                if node.right:
+                    cur.next = node.right
+                    cur = cur.next
+                    
+                node = node.next
+            node = dummy.next
+        return root

Daily-challenge/Dec/07/README.md

@@ -1,15 +1,22 @@
-# Add Two Numbers II
-You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
+# Spiral Matrix II
+Given a positive integer n, generate an n x n matrix filled with elements from 1 to n2 in spiral order.
 
-You may assume the two numbers do not contain any leading zero, except the number 0 itself.
+![idk](https://assets.leetcode.com/uploads/2020/11/13/spiraln.jpg)
 
-Follow up:
-What if you cannot modify the input lists? In other words, reversing the lists is not allowed.
+Example 1:
 
-Example:
 
-Input: (7 -> 2 -> 4 -> 3) + (5 -> 6 -> 4)
-Output: 7 -> 8 -> 0 -> 7<br>
+Input: n = 3
+Output: [[1,2,3],[8,9,4],[7,6,5]]
+Example 2:
+
+Input: n = 1
+Output: [[1]]
+ 
+
+Constraints:
+
+1 <= n <= 20<br>
 
 ## Idea