剑指offer——有序二维数组中查找数字 C++

根据有序二维数组规律，上小下大，左小右大

bool Find(int*matrix,int rows,int columns,int number)
{
	bool found = false;
	if(matrix != nullptr && rows>0 && column >0)
	{
		int row = 0;
		int column =columns-1;
		while(row<rows&&column>=0)
		{
			if (matrix[row*columns+column]==number)
			{
				found = true;
				break;
			}
			else if (matrix[row*columns+column]>number)
				--column;
			else
				++row;
			}
		}
		return found;
	}