如何改正？？？？？？？？？？

[betterhalf]

#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
bool Find(int target, vector<vector<int> > array) {
int m = array.size();
int n = array[0].size();
int row = m - 1;
int column = 0;

if (m == 0 && n == 0)
return false;

while (row >= 0 && column<n)
{
if (target>array[row][column])
column++;
else if (target<array[row][column])
row--;

else
return true;
}

return false;
}

};

int main() {

vector<vector<int>> test;
vector<int> v;
int n, temp;

cin >> n;
test.clear();

//输入
for (int i = 0; i<n; i++) {
v.clear(); //每次记得clear:)
for (int j = 0; j < n; j++)
{
cin >> temp;
v.push_back(temp);
}
test.push_back(v);
}
Find(5,test);
}

[flying_music]

#include <iostream>
#include <vector>

using namespace std;
class Solution {
public:
    bool Find(int target, vector<vector<int> > array) {
        int m = array.size();
        int n = array[0].size();
        int row = m - 1;
        int column = 0;

        if (m == 0 && n == 0)
            return false;

        while (row >= 0 && column<n)
        {
            if (target>array[row][column])
                column++;
            else if (target<array[row][column])
                row--;
            else
                return true;
        }
        return false;
}

};

 int main() {
    Solution S;
    vector< vector<int> > test;
    vector<int> v;
    int n, temp;

    cin >> n;
    test.clear();

    //输入
    for (int i = 0; i<n; i++) {
        v.clear(); //每次记得clear:)
        for (int j = 0; j < n; j++)
        {
            cin >> temp;
            v.push_back(temp);
        }
        test.push_back(v);
    }
    cout<<S.Find(5,test)<<endl;;
}

[paschen]

#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
	static bool Find(int target, vector<vector<int> > array) {
		int m = array.size();
		int n = array[0].size();
		int row = m - 1;
		int column = 0;

		if (m == 0 && n == 0)
			return false;

		while (row >= 0 && column < n)
		{
			if (target > array[row][column])
				column++;
			else if (target < array[row][column])
				row--;

			else
				return true;
		}

		return false;
	}

};

int main() {

	vector<vector<int>> test;
	vector<int> v;
	int n, temp;

	cin >> n;
	test.clear();

	//输入
	for (int i = 0; i < n; i++) {
		v.clear(); //每次记得clear:)
		for (int j = 0; j < n; j++)
		{
			cin >> temp;
			v.push_back(temp);
		}
		test.push_back(v);
	}
	Solution::Find(5, test);
}

[betterhalf]

引用 2 楼 paschen 的回复:

#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
	static bool Find(int target, vector<vector<int> > array) {
		int m = array.size();
		int n = array[0].size();
		int row = m - 1;
		int column = 0;

		if (m == 0 && n == 0)
			return false;

		while (row >= 0 && column < n)
		{
			if (target > array[row][column])
				column++;
			else if (target < array[row][column])
				row--;

			else
				return true;
		}

		return false;
	}

};

int main() {

	vector<vector<int>> test;
	vector<int> v;
	int n, temp;

	cin >> n;
	test.clear();

	//输入
	for (int i = 0; i < n; i++) {
		v.clear(); //每次记得clear:)
		for (int j = 0; j < n; j++)
		{
			cin >> temp;
			v.push_back(temp);
		}
		test.push_back(v);
	}
	Solution::Find(5, test);
}

有问题啊