C++二维数组中的查找算法示例

 #include  #include  using namespace std; bool Find(int target, vector > array) { int row = array.size();   //行数 int column = array[0].size();  //列数 int i = 0, j = column - 1; while (i = 0) { if (array[i][j] == target) //从右上角第一个找起，大于target向左查找，小于target则向下查找 { return true; } else if (array[i][j] > target) { j--;    //向左查找 } else { i++;    //向下查找 } } return false; } int main() { vector vec1{ 3, 7, 9, 12, 19, 23 }; vector vec2{ 4, 17, 19, 31, 32, 33 }; vector > array; array.push_back(vec1); array.push_back(vec2); bool result = Find(32, array); cout << "result = " << result << endl; system("pause"); }