杨氏矩阵(C语言实现)

        如果一个矩阵的每一行从左至右依次递增，每一列从上到下依次递增，则成这样的矩阵为杨氏矩阵

void young_tableau_search(int arr[3][3], int k, int *px, int *py)
{
	int x = 0;
	int y = *py-1;
	int flag = 0;
	while (x <= *px-1 && y >= 0)
	{
		if (arr[x][y] < k)
		{
			x++;
		}
		else if (arr[x][y] > k)
		{
			y--;
		}
		else
		{
			*px = x;
			*py = y;
			return;
		}
	}
	*px = -1;
	*py = -1;
}

int main()
{
	int arr[3][3] = { 1,2,3,4,5,6,7,8,9 };
	int k = 0;
	scanf("%d", &k);
	int x = 3;
	int y = 3;
	young_tableau_search(arr, k, &x, &y);

	if (x == -1 && y == -1)
		printf("找不到\n");
	else
		printf("找到了，下标是：%d %d\n", x, y);
	return 0;
}