有序二维数组查找元素

#include
#include
using namespace std;
class Solution {
public:
bool Find(int target, vector<vector > array) {
if (array.empty())
return false;
int row = array.size();
int col = array[0].size();
for (int i = 0;i < row;i++)
{
if (array[i].empty())return false;
else if (array[i][0] <= target)
{
if (target <= array[i][col - 1])
{
for (int j = 0;j < col;j++)
{
if (array[i][j] == target)
return true;
}
}
else continue;
}
else return false;
}
return false;
}
};
int main()
{
int target = 0;
cin >> target;
int row = 3;
int col = 3;
vector<vector>arr(row);
for (int i = 0;i < row;i++)
{
for (int j = 0;j < col;j++)
{
arr[i].push_back(0);
}
}
for (int i = 0;i < row;i++)
{
for (int j = 0;j < col;j++)
{
cin >> arr[i][j];
}
}
Solution s;
cout << s.Find(target,arr);
return 0;
}