C语言：在二维数组中，每行每列都按照递增的顺序排序，判断数组中是否包含一个数。

#define _crt_secure_no_warnings 1
#include<stdio.h>
#include<stdlib.h>
int search_target(int arr[], int target, int row, int column)
{
 int row = 0;
 int column = column - 1;
 if (arr != null && row > 0 && column > 0)
 {
  while (row < row && column >= 0)
  {
   if (arr[row * column + column] == target)
   {
    return 1;
   }
   else if (arr[row * column + column] < target)
   {
    ++row;
   }
   else if (arr[row * column + column] > target)
   {
    --column;
   }
  }
  return 0;
 }
 return 0;
}
int main()
{
 int arr[][3] = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
 int ret = search_target(arr, 7, 3, 3);
 if (ret == 1)
 {
  printf("exist\n");
 }
 else
 {
  printf("not exist\n");
 }
 system("pause");
 return 0;
}