aboutsummaryrefslogtreecommitdiff
path: root/other/kth_smallest_sorted_matrix.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'other/kth_smallest_sorted_matrix.cpp')
-rw-r--r--other/kth_smallest_sorted_matrix.cpp30
1 files changed, 0 insertions, 30 deletions
diff --git a/other/kth_smallest_sorted_matrix.cpp b/other/kth_smallest_sorted_matrix.cpp
deleted file mode 100644
index aad9458..0000000
--- a/other/kth_smallest_sorted_matrix.cpp
+++ /dev/null
@@ -1,30 +0,0 @@
-#include "leetcode.h"
-
-class Solution {
-public:
- int kthSmallest(vector<vector<int>> &matrix, int k) {
- int n = matrix.size(), left = matrix[0][0], right = matrix[n - 1][n - 1],
- mid = 0;
- while (left < right) {
- mid = left + (right - left) / 2;
- int num = 0;
- for (int i = 0; i < n; i++) {
- int pos = upper_bound(matrix[i].begin(), matrix[i].end(), mid) -
- matrix[i].begin();
- num += pos;
- }
- if (num < k)
- left = mid + 1;
- else
- right = mid;
- }
- return left;
- }
-};
-
-int main() {
- Solution obj;
- vector<vector<int>> matrix;
- int k;
- obj.kthSmallest(matrix, k);
-}