-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
73 lines (56 loc) · 954 Bytes
/
Copy pathmain.cpp
File metadata and controls
73 lines (56 loc) · 954 Bytes
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
65
66
67
68
69
70
71
72
73
// 在一个二维数组中查找某个数
// 二维数组从左至右递增，从上至下递增。
#include <iostream>
#include <vector>
using std::vector;
bool Search(const vector<vector<int> >&vec, int searchNum)
{
bool ret = false;
unsigned int size = vec.size();
if (size > 0)
{
int baseNum = vec[0][size - 1];
int row = 0;
int column = size - 1;
while (row < size && column >= 0)
{
if (searchNum == vec[row][column])
{
ret = true;
break;
}
else if (searchNum > vec[row][column])
row += 1;
else
column -= 1;
}
}
return ret;
}
int main()
{
int n;
std::cin >> n;
vector<vector<int> >vec;
vec.resize(n);
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
int num = 0;
std::cin >> num;
vec[i].push_back(num);
}
}
int searchNum = 0;
std::cin >> searchNum;
if (Search(vec, searchNum))
{
std::cout << "Yes" << std::endl;
}
else
{
std::cout << "No" << std::endl;
}
return 0;
}