# vector二维数组的插入遍历查找

col >= 0 && row < array[0].size()

#include <iostream>
#include <vector>
using namespace std;

class Solution {
public:
bool Find(int target,vector<vector<int> > array)
{
int row = 0;//列
int col = array.size()-1;//行
//cout <<array[2][3] << endl;
while ((col >= 0 && row < array[0].size()))
{
if (array[col][row] == target)
return true;
if (array[col][row] < target)
row++;
else if (array[col][row] > target)
{
col--;
}
//cout<<array[col][row]<<endl;
}
return false;

}

};

int main()
{

vector<vector<int> > array;
int mNum = 0;
vector<int> array2;
for(int i= 0 ;i<3;i++)
{
for (int j = 0; j < 3; j++)
{
array2.push_back(mNum++);
//cout << array2[j] << endl;
}
array.push_back(array2);
array2.erase(array2.begin(),array2.end() );
}

for (vector<vector<int> >::iterator it = array.begin() ; it != array.end(); it++)
{

for(vector<int>::iterator it2=(*it).begin();it2<(*it).end();it2++)
cout << *it2 << "";
}
cout << "" << endl;
Solution sol;
bool bu = sol.Find(2, array);
cout << bu << endl;
return 0;
}

08-18 2158

07-07 1万+
04-19 1732
08-02 3727
03-06 2万+
03-09 63
08-01 9万+
08-20 4576
03-20 1479
07-10 6万+