Merge pull request #568 from tolookme/master

GeekUniversity · web-flow · commit b6313fc5bd43 · 2019-05-06T12:12:23.000+08:00
078 第三周作业提交
diff --git a/Week_03/id_78/LeetCode_373_78.cpp b/Week_03/id_78/LeetCode_373_78.cpp
@@ -0,0 +1,38 @@
+class Solution {
+
+public:
+    
+struct cmpare {
+    bool operator () (pair<int, int> a, pair<int, int> b) {
+        return (a.first + a.second) > (b.first + b.second);
+    }
+};
+    
+vector<vector<int>> kSmallestPairs(vector<int>& nums1, vector<int>& nums2, int k) {
+    
+        priority_queue<pair<int, int>,vector<pair<int, int>>,cmpare> heap;
+        int i,j;
+        int len1 = nums1.size();
+        int len2 = nums2.size();
+    
+        for (i = 0; i < len1; i++){
+            for(j = 0; j < len2; j++) {
+                heap.push(make_pair(nums1[i],nums2[j]));
+            }
+        }
+        
+        vector<vector<int> > res;
+        while (k-- > 0 && heap.size() > 0) {
+            vector<int> vec;
+            pair<int,int> p1;
+            p1 = heap.top();
+            vec.push_back(p1.first);
+            vec.push_back(p1.second);
+            res.push_back(vec);
+            heap.pop();
+        }
+    
+        return res;
+    }
+};
+
diff --git a/Week_03/id_78/LeetCode_703_78.cpp b/Week_03/id_78/LeetCode_703_78.cpp
@@ -0,0 +1,36 @@
+class KthLargest {
+public:
+    
+    KthLargest(int k, vector<int>& nums) {
+        m_size = k;
+        int len = nums.size();
+        int i = 0;
+        for (i = 0; i < len; i++) {
+            heap.push(nums[i]);
+            if (heap.size() > m_size) {
+                heap.pop();
+            }
+        } 
+    }
+    
+    int add(int val) {
+        heap.push(val);
+        if (heap.size() > m_size) {
+            heap.pop();
+        }
+        
+        return heap.top();
+    }
+    
+private:
+    priority_queue<int, vector<int>, greater<int> > heap;
+    int m_size;
+
+};
+
+/**
+ * Your KthLargest object will be instantiated and called as such:
+ * KthLargest* obj = new KthLargest(k, nums);
+ * int param_1 = obj->add(val);
+ */
+
