c_cpp ＃74搜索二维矩阵

Posted 2021-05-14

//思路：比较每一行的首元素和末尾元素，之后在该行进行遍历
//时间：8 ms
class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        if(matrix.size() == 0 || matrix[0].size() == 0) return false;
        for(int i = 0;i < matrix.size();++i){
            if(target >= matrix[i][0] && target <= matrix[i][matrix[i].size()-1]){
                for(int j = 0;j < matrix[i].size();++j){
                    if(target == matrix[i][j])  return true;
                }
            }
        }
        return false;
    }
};