-
Notifications
You must be signed in to change notification settings - Fork 0
/
240.hpp
64 lines (49 loc) · 1.31 KB
/
240.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#ifndef LEETCODE_240_HPP
#define LEETCODE_240_HPP
#include <iostream>
#include <queue>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <numeric>
using namespace std;
/**
Write an efficient algorithm that searches for a value in an m x n matrix.
This matrix has the following properties:
Integers in each row are sorted in ascending from left to right.
Integers in each column are sorted in ascending from top to bottom.
For example,
Consider the following matrix:
[
[1, 4, 7, 11, 15],
[2, 5, 8, 12, 19],
[3, 6, 9, 16, 22],
[10, 13, 14, 17, 24],
[18, 21, 23, 26, 30]
]
Given target = 5, return true.
Given target = 20, return false.
*/
class Solution {
public:
bool searchMatrix(vector<vector<int>> &matrix, int target) {
if (matrix.size() == 0 || matrix[0].size() == 0) {
return false;
}
int i = 0, j = (int) (matrix[0].size() - 1);
while (i < matrix.size() && j >= 0) {
auto v = matrix[i][j];
if (v == target) {
break;
} else if (v > target) {
j--;
} else {
i++;
}
}
return i < matrix.size() && j >= 0 && matrix[i][j] == target;
}
};
#endif //LEETCODE_240_HPP