From fc0cdae256df36b113633e4babb9ef5e1d8baa4d Mon Sep 17 00:00:00 2001
From: confidence93 <363028152@qq.com>
Date: Sun, 16 Jun 2019 22:42:28 +0800
Subject: [PATCH 1/3] homework

---
 Week_02/id_14/LeetCode_111_14.py.txt | 19 +++++++++++++++++++
 Week_02/id_14/LeetCode_1_14.py.txt   | 14 ++++++++++++++
 Week_02/id_14/LeetCode_242_14.py.txt |  8 ++++++++
 Week_02/id_14/LeetCode_3_14.py.txt   | 14 ++++++++++++++
 Week_02/id_14/LeetCode_692_14.py.txt |  7 +++++++
 5 files changed, 62 insertions(+)
 create mode 100644 Week_02/id_14/LeetCode_111_14.py.txt
 create mode 100644 Week_02/id_14/LeetCode_1_14.py.txt
 create mode 100644 Week_02/id_14/LeetCode_242_14.py.txt
 create mode 100644 Week_02/id_14/LeetCode_3_14.py.txt
 create mode 100644 Week_02/id_14/LeetCode_692_14.py.txt

diff --git a/Week_02/id_14/LeetCode_111_14.py.txt b/Week_02/id_14/LeetCode_111_14.py.txt
new file mode 100644
index 00000000..8509d3f2
--- /dev/null
+++ b/Week_02/id_14/LeetCode_111_14.py.txt
@@ -0,0 +1,19 @@
+# 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 minDepth(self, root):
+        """
+        :type root: TreeNode
+        :rtype: int
+        """
+        if root == None:
+            return 0
+        if root.left==None or root.right==None:
+            return self.minDepth(root.left)+self.minDepth(root.right)+1
+        return min(self.minDepth(root.right),self.minDepth(root.left))+1
+        
\ No newline at end of file
diff --git a/Week_02/id_14/LeetCode_1_14.py.txt b/Week_02/id_14/LeetCode_1_14.py.txt
new file mode 100644
index 00000000..c460a8d6
--- /dev/null
+++ b/Week_02/id_14/LeetCode_1_14.py.txt
@@ -0,0 +1,14 @@
+class Solution(object):
+    def twoSum(self, nums, target):
+        """
+        :type nums: List[int]
+        :type target: int
+        :rtype: List[int]
+        """
+        obj = {}
+        for i in range(len(nums)):
+            num = nums[i]
+            if target - num in obj:
+                return obj[target-num], i
+            if num not in obj:
+                obj[num] = i
\ No newline at end of file
diff --git a/Week_02/id_14/LeetCode_242_14.py.txt b/Week_02/id_14/LeetCode_242_14.py.txt
new file mode 100644
index 00000000..469e1cdc
--- /dev/null
+++ b/Week_02/id_14/LeetCode_242_14.py.txt
@@ -0,0 +1,8 @@
+class Solution(object):
+    def isAnagram(self, s, t):
+        """
+        :type s: str
+        :type t: str
+        :rtype: bool
+        """
+        return sorted(s) == sorted(t)
\ No newline at end of file
diff --git a/Week_02/id_14/LeetCode_3_14.py.txt b/Week_02/id_14/LeetCode_3_14.py.txt
new file mode 100644
index 00000000..d0e1d71d
--- /dev/null
+++ b/Week_02/id_14/LeetCode_3_14.py.txt
@@ -0,0 +1,14 @@
+class Solution:
+    def lengthOfLongestSubstring(self, s):
+        """
+        :type s: str
+        :rtype: int
+        """
+        st = {}
+        i, ans = 0, 0
+        for j in range(len(s)):
+            if s[j] in st:
+                i = max(st[s[j]], i)
+            ans = max(ans, j - i + 1)
+            st[s[j]] = j + 1
+        return ans
\ No newline at end of file
diff --git a/Week_02/id_14/LeetCode_692_14.py.txt b/Week_02/id_14/LeetCode_692_14.py.txt
new file mode 100644
index 00000000..fa7618af
--- /dev/null
+++ b/Week_02/id_14/LeetCode_692_14.py.txt
@@ -0,0 +1,7 @@
+class Solution(object):
+    def topKFrequent(self, words, k):
+        obj = {}
+        for word in words:
+            obj[word] = obj.get(word, 0) + 1
+        ret = sorted(obj, key=lambda word: (-obj[word], word))
+        return ret[:k]
\ No newline at end of file

From 15616ec14c166b5e784d5fab4d0057f2dd7c6fbc Mon Sep 17 00:00:00 2001
From: confidence93 <363028152@qq.com>
Date: Sun, 23 Jun 2019 23:36:05 +0800
Subject: [PATCH 2/3] homework

---
 Week_03/id_14/LeetCode_104_14.py.txt | 14 ++++++++++++++
 Week_03/id_14/LeetCode_429_14.py.txt | 27 +++++++++++++++++++++++++++
 Week_03/id_14/LeetCode_703_14.py.txt |  0
 3 files changed, 41 insertions(+)
 create mode 100644 Week_03/id_14/LeetCode_104_14.py.txt
 create mode 100644 Week_03/id_14/LeetCode_429_14.py.txt
 create mode 100644 Week_03/id_14/LeetCode_703_14.py.txt

diff --git a/Week_03/id_14/LeetCode_104_14.py.txt b/Week_03/id_14/LeetCode_104_14.py.txt
new file mode 100644
index 00000000..aabcb306
--- /dev/null
+++ b/Week_03/id_14/LeetCode_104_14.py.txt
@@ -0,0 +1,14 @@
+# 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 maxDepth(self, root):
+        """
+        :type root: TreeNode
+        :rtype: int
+        """
+        return 1 + max(map(self.maxDepth, (root.left, root.right))) if root else 0
\ No newline at end of file
diff --git a/Week_03/id_14/LeetCode_429_14.py.txt b/Week_03/id_14/LeetCode_429_14.py.txt
new file mode 100644
index 00000000..ddd5f589
--- /dev/null
+++ b/Week_03/id_14/LeetCode_429_14.py.txt
@@ -0,0 +1,27 @@
+"""
+# Definition for a Node.
+class Node(object):
+    def __init__(self, val, children):
+        self.val = val
+        self.children = children
+"""
+class Solution(object):
+    def levelOrder(self, root):
+        """
+        :type root: Node
+        :rtype: List[List[int]]
+        """
+        if not root:
+            return []
+        res = []
+        stack = [root]
+        while stack:
+            temp = []
+            next_stack = []
+            for node in stack:
+                temp.append(node.val)
+                for child in node.children:
+                    next_stack.append(child)
+            stack = next_stack
+            res.append(temp)
+        return res
\ No newline at end of file
diff --git a/Week_03/id_14/LeetCode_703_14.py.txt b/Week_03/id_14/LeetCode_703_14.py.txt
new file mode 100644
index 00000000..e69de29b

From b82fa7107c69c5688afd78e673693a7c998abd74 Mon Sep 17 00:00:00 2001
From: confidence93 <363028152@qq.com>
Date: Sun, 23 Jun 2019 23:41:10 +0800
Subject: [PATCH 3/3] homework

---
 Week_03/id_14/LeetCode_703_14.py.txt | 26 ++++++++++++++++++++++++++
 1 file changed, 26 insertions(+)

diff --git a/Week_03/id_14/LeetCode_703_14.py.txt b/Week_03/id_14/LeetCode_703_14.py.txt
index e69de29b..4230002e 100644
--- a/Week_03/id_14/LeetCode_703_14.py.txt
+++ b/Week_03/id_14/LeetCode_703_14.py.txt
@@ -0,0 +1,26 @@
+import heapq
+
+class KthLargest(object):
+
+    def __init__(self, k, nums):
+        """
+        :type k: int
+        :type nums: List[int]
+        """
+        self.nums = nums
+        self.k = k
+        heapq.heapify(self.nums)
+        while len(self.nums) > k:
+            heapq.heappop(self.nums)
+
+            
+    def add(self, val):
+        if len(self.nums) < self.k:
+            heapq.heappush(self.nums, val)
+        elif val > self.nums[0]:
+            heapq.heapreplace(self.nums, val)
+        return self.nums[0]
+
+# Your KthLargest object will be instantiated and called as such:
+# obj = KthLargest(k, nums)
+# param_1 = obj.add(val)
\ No newline at end of file