剑指offer编程－二维数组中的查找

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

class Solution {
public:
    bool Find(int target, vector<vector<int> > array) {
        int rows_num = array.size()-1;
        int cols_num = array[0].size()-1;
        int i = 0;
        while (i<=rows_num && cols_num>=0){
            if (array[i][cols_num] == target)
                return true;
            else if (array[i][cols_num] < target)
                i++;
            else if (array[i][cols_num] > target)
                cols_num--;
        }
        return false;
    }
};

int _tmain(int argc, _TCHAR* argv[])
{
    vector<vector<int> > array;
    int target;
    vector<int> v;
    int i, j, temp;
    cout << "input array:\n";
    for (i = 0; i < 4; i++){
        v.clear();
        for (j = 0; j < 4; j++){
            cin >> temp;
            v.push_back(temp);
        }
        array.push_back(v);
    }
    cout << "input target:";
    cin >> target;
    
    Solution S;
    if (S.Find(target, array))
        cout << "Yes!";
    else
        cout << "No!";

    cout << "按任意键继续……";
    cin.clear();
    cin.sync();
    cin.get();
    return 0;
}