My C++ soluation using Binary search Tree model beats 100%~~~~
at first i use binary search method, but i found it's hard to pruning Redundant situation,and i just found we can treat the left bottom as a root of a BST so we
at first i use binary search method, but i found it's hard to pruning Redundant situation,and i just found we can treat the left bottom as a root of a BST so we only need o(m+N) to find the target.\n\n    class Solution {\n    public:\n        bool searchMatrix(vector<vector<int>>& matrix, int target) {\n            int row = matrix.size();\n            int col = matrix[0].size();\n            int i = row-1,j =0;\n            while(i>=0&&j<=col-1)\n            {\n                if(target>matrix[i][j])\n                {\n                    j++;\n                }\n                else if(target<matrix[i][j])\n                {\n                    i--;\n                }\n                else\n                {\n                    return true;\n                }\n            }\n            return false;\n        }\n    };
['Binary Search Tree']