LeetCode 240. Search a 2D Matrix II

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

• Integers in each row are sorted in ascending from left to right.
• Integers in each column are sorted in ascending from top to bottom.

For example,

Consider the following matrix:

[  [1,   4,  7, 11, 15],  [2,   5,  8, 12, 19],  [3,   6,  9, 16, 22],  [10, 13, 14, 17, 24],  [18, 21, 23, 26, 30]]

Given target = 5, return true.

Given target = 20, return false.

Observe carefully... 0 colomn and m-1 row is a increasing sequence.... same with 1 column and m-2 row....etc al.

#include <vector>#include <iostream>using namespace std;bool searchMatrix(vector<vector<int>>& matrix, int target) {    if(matrix.size() == 0) return false;    if(matrix[0].size() == 0) return false;    int m = matrix.size();    int n = matrix[0].size();    int i = m-1, j = 0;    while(i >= 0 && j < n) {        if(matrix[i][j] == target) return true;        else if(matrix[i][j] < target) j++;        else i--;    }    return false;}int main(void) {    vector< vector<int> > matrix{        {1, 4, 7, 11, 15},        {2, 5, 8, 12, 19},        {3, 6, 9, 16, 22},        {10, 13, 14, 17, 24},        {18, 21, 23, 26, 30}};    bool found = searchMatrix(matrix, 5);    cout << found << endl;}