【C语言】每日一代码：杨氏矩阵

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
int find_num(int arr[3][3], int col, int row, int k)
{
	int i = 0;
	//从右上角数字查找
	while (k != arr[i][row - 1] && i < col && row >= 0)
	{
		if (k < arr[i][row - 1])
		{
			row--;
		}
		else
		{
			i++;
		}
	}
	if (k == arr[i][row - 1])
		return 1;//找到了，返回1
	else
		return 0;//没找到，返回0
}
int main()
{
	int arr[3][3] = { 1,2,3,4,5,6,7,8,9 };
	int k = 0;
	scanf("%d", &k);
	int ret = find_num(arr, 3, 3, k);
	if (ret == 1)
	{
		printf("找到了\n");
	}
	else
	{
		printf("找不到\n");
	}
	return 0;
}