有一个二维数组. 数组的每行从左到右是递增的,每列从上到下是递增的. 在这样的数组中查找一个数字是否存在。

#include<stdio.h>


#pragma warning(disable:4996)
#define ROW 3
#define COL 3


int Yang(int arr[ROW][COL], int value)
{
int i = 0;
int j = COL - 1;
int tmp = arr[i][j];
while (1)


{
if (tmp == value)
{
return 1;
}
else if (tmp < value&&j >= 0)
{
tmp = arr[++i][j];
}
else if (tmp > value&&j >= 0)
{
tmp = arr[i][--j];
}
else
{
return 0;
}
}
}




int main()
{
int arr[ROW][COL] = { { 1, 2, 3 }, { 2, 3, 4 }, { 3, 4, 5 } };
int i = 0;
int j = 0;
int num;
printf("数组为:\n");
for (; i < ROW; i++){
for (; j < COL; j++){
printf("%5d", arr[i][j]);
}
printf("\n");
}
printf("请输入:");
scanf("%d", &num);
if (Yang(arr,num))
{
printf("在该数组中\n",num);
}
else
{
printf("不在该数组中\n",num);
}
system("pause");
return 0;
}

猜你喜欢

转载自blog.csdn.net/lsfan0213/article/details/80197375