二维数组中查找指定数据
- 数组中元素每行按照从左到右递增,每列从上到下递增
bool Find(int* arr, int rows, int columns, int data)
{
bool found = false;
if (arr != NULL && rows > 0 && columns > 0)
{
int row = 0;
int column = columns - 1;
while (row < rows && column >=0)
{
if (arr[row*columns + column] == data)
{
found = true;
break;
}
else if (arr[row*columns + column] > data)
--column;
else
++row;
}
}
return found;
}
bool Find(int* arr, int rows, int columns, int data)
{
bool found = false;
if (arr != NULL && rows > 0 && columns > 0)
{
int row = rows - 1;
int column = 0;
while (row < rows && column >= 0)
{
if (arr[row*columns + column] == data)
{
found = true;
break;
}
else if (arr[row*columns + column] < data)
++column;
else
--row;
}
}
return found;
}
- 数组中元素每行按照从左到右递减,每列从上到下递减
bool Find(int* arr, int rows, int columns, int data)
{
bool found = false;
if (arr != NULL && rows > 0 && columns > 0)
{
int row = 0;
int column = columns - 1;
while (row < rows && column >= 0)
{
if (arr[row*columns + column] == data)
{
found = true;
break;
}
else if (arr[row*columns + column] < data)
--column;
else
++row;
}
}
return found;
}
bool Find(int* arr, int rows, int columns, int data)
{
bool found = false;
if (arr != NULL && rows > 0 && columns > 0)
{
int row = rows - 1;
int column = 0;
while (row < rows && column >= 0)
{
if (arr[row*columns + column] == data)
{
found = true;
break;
}
else if (arr[row*columns + column] > data)
++column;
else
--row;
}
}
return found;
}