【C语言】【面试题】【笔试题】二维数组中的查找，杨氏矩阵

#define _CRT_SECURE_NO_WARNINGS 1

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include<windows.h>
int find(int arr[], int rows, int columns, int num)
{
int find = 0;
if (arr != NULL && rows > 0 && columns > 0)
{
int row = 0;
int column = columns - 1;
while (row < rows && column >= 0)
{
if (arr[row*columns + column] == num)
{
find = 1;
break;
}
else if (arr[row*columns + column] > num)
{
column--;
}
else
{
row++;
}
}
}
return find;
}
int main()
{
int arr[3][3] = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
int ret=find(arr, 3, 3, 7);
if (ret == 1)
{
printf("EXIST!!!!\n");
}
else
{
printf("NOT EXIST!!!\n");
}
system("pause");
return 0;
}