BJ001-1904150 Week2 homework

Week_02/id_150/leetcode_609_BJ001-1904150.py

@@ -0,0 +1,23 @@
+class Solution(object):
+    def findDuplicate(self, paths):
+        """
+        :type paths: List[str]
+        :rtype: List[List[str]]
+        """
+        dd = {}
+        for path in paths:
+            plist = path.split(" ")
+            prefix = plist[0];
+            for i in range(1, len(plist)):
+                route = prefix + "/" + plist[i].split("(")[0]
+                content = plist[i].split("(")[1].split(")")[0]
+                if content not in dd:
+                    dd[content] = []
+                dd[content].append(route)
+
+        res = []
+        for key in dd:
+            if len(dd[key]) > 1:
+                res.append(dd[key])
+
+        return res

Week_02/id_150/leetcode_671_BJ001-1904150.cpp

@@ -0,0 +1,31 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+ * };
+ */
+
+class Solution {
+public:
+    int findSecondMinimumValue(TreeNode* root) {
+        if(root == NULL && root->left == NULL)
+            return -1;
+        long long ans = findmin(root, root->val);
+        return ans == 2147483648 ? -1 : ans;
+    }
+
+    long long findmin(TreeNode* root, int val) {
+        if(root) {
+            if(root->val > val) {
+                return root->val;
+            }
+            return min(findmin(root->left, val), findmin(root->right, val) );
+        }
+        return 2147483648;
+    }
+};
+
+

Week_02/id_150/leetcode_692_BJ001-1904150.cpp

@@ -0,0 +1,43 @@
+typedef pair<string, int> P;
+struct cmp
+{
+    bool operator()(const P p1, const P p2)
+    {
+        if(p1.second != p2.second)
+            return p1.second < p2.second;
+        return p1.first > p2.first;
+    }
+
+};
+
+class Solution {
+public:
+    vector<string> topKFrequent(vector<string>& words, int k) {
+        vector<string> ans;
+
+        map<string, int> mp;
+        map<string, int> :: iterator iter;
+        for(int i = 0; i < words.size(); i++) {
+            string tmp = words[i];
+            if(mp.find(tmp) != mp.end()) {
+                mp[tmp]++;
+            } else {
+                mp[tmp] = 1;
+            }
+        }
+
+        priority_queue<P, vector<P>, cmp> que;
+        for(iter = mp.begin(); iter != mp.end(); iter++) {
+            que.push(P(iter->first, iter->second));
+        }
+
+        while(ans.size() != k) {
+            P tmp = que.top();
+            ans.push_back(tmp.first);
+            que.pop();
+        }
+
+        return ans;
+    }
+};
+