240. 搜索二维矩阵 II ，输入输出

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

class Solution1{
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        int m = matrix.size();
        if(m == 0) return false;
        int n = matrix[0].size();
        int i = m - 1, j = 0;
        while (i >= 0 && j < n)
        {
            if (matrix[i][j] > target)
            {
                i--;
            }
            else if (matrix[i][j] < target)
            {
                j++;
            }
            else
                return true;
        }
        return false;
    }
};


void test2()
{
    int m, n;
    cin >> m >> n;
    vector<vector<int>> matrix(m, vector<int>(n));
    int x;
    for (int i = 0; i < m; i++)
    {
        for (int j = 0; j < n; j++)
        {
            cin >> x;
            matrix[i][j] = x;
        }
    }
    int target;
    cin >> target;
    Solution1 S;
    cout<<S.searchMatrix(matrix, target)<<endl;
}
int main()
{
    //test1();
    test2();
    return 0;
}