2019-07-13

Author: JiayangWu

0298.二叉树最长连续序列/0298-二叉树最长连续序列.py

@@ -0,0 +1,36 @@
+# Definition for a binary tree node.
+# class TreeNode(object):
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+class Solution(object):
+    def longestConsecutive(self, root):
+        """
+        :type root: TreeNode
+        :rtype: int
+        """
+        if not root:
+            return 0
+        if not root.left and not root.right:
+            return 1
+        
+        self.res = 1
+        def dfs(node, tmp, parent_val):
+            if not node:
+                return 
+            if node.val == parent_val + 1:
+                tmp += 1
+                self.res = max(self.res, tmp)
+            else:
+                tmp = 1
+                
+            dfs(node.left, tmp, node.val)
+            dfs(node.right, tmp, node.val)
+            
+        dfs(root.left, 1, root.val)
+        dfs(root.right, 1, root.val)
+        
+        return self.res
+            

0359.日志速率限制器/0359-日志速率限制器.py

@@ -0,0 +1,31 @@
+class Logger(object):
+
+    def __init__(self):
+        """
+        Initialize your data structure here.
+        """
+        from collections import defaultdict
+        self.record = defaultdict(set)
+        
+
+    def shouldPrintMessage(self, timestamp, message):
+        """
+        Returns true if the message should be printed in the given timestamp, otherwise returns false.
+        If this method returns false, the message will not be printed.
+        The timestamp is in seconds granularity.
+        :type timestamp: int
+        :type message: str
+        :rtype: bool
+        """
+        
+        for i in range(timestamp - 9, timestamp + 1):
+            if message in self.record[i]:
+                return False
+        self.record[timestamp].add(message)
+        return True
+        
+
+
+# Your Logger object will be instantiated and called as such:
+# obj = Logger()
+# param_1 = obj.shouldPrintMessage(timestamp,message)

0445.两数相加II/0445-两数相加II.py

@@ -0,0 +1,49 @@
+# Definition for singly-linked list.
+# class ListNode(object):
+#     def __init__(self, x):
+#         self.val = x
+#         self.next = None
+
+class Solution(object):
+    def addTwoNumbers(self, l1, l2):
+        """
+        :type l1: ListNode
+        :type l2: ListNode
+        :rtype: ListNode
+        """
+        s1, s2 = [], []
+        while l1:
+            s1.append(l1.val)
+            l1 = l1.next
+            
+        while l2:
+            s2.append(l2.val)
+            l2 = l2.next
+        
+        carry = 0
+        cur = ListNode(-1)
+        while s1 or s2:
+            value = carry
+            if s1:
+                value += s1.pop()
+            if s2:
+                value += s2.pop()
+
+            carry = value > 9
+            value %= 10
+            
+            cur.val = value
+            pre = ListNode(-1)
+            pre.next = cur
+            cur = pre
+            
+        if carry: #´¦Àí¿ÉÄܵĽøλ
+            pre.val = 1
+            return pre
+        
+        return pre.next
+
+                
+        
+        
+