题目:在二维数组中查找一个数
(具体不说了,参考剑指offer书)
代码如下:
#include<iostream>
using namespace std;
bool Find(int* matrix,int rows,int columns,int number)
{
bool found=false;
if(matrix!=NULL&&rows>0&&columns>0)
{
int row=0;
int column=columns-1;
while(row<rows&&column>=0)
{
if(matrix[row*columns+column]==number)
{
found=true;
break;
}
else if(matrix[row*columns+column]>number)
--column;
else
++row;
}
}
return found;
}
void test(char* Testname,int* matrix, int rows, int columns, int number,bool expected)
{
if(Testname!=NULL)
cout<<"begin"<<Testname<<endl;
bool result=Find(matrix,rows,columns,number);
if(result==expected)
cout<<"pass";
else
cout<<"fail";
}
void Test1()
{
int matrix[][4] = {{1, 2, 8, 9}, {2, 4, 9, 12}, {4, 7, 10, 13}, {6, 8, 11, 15}};
test("Test1", (int*)matrix, 4, 4, 7,true);
}
int main()
{
Test1();
return 0;
}