leedcode m*n矩阵找target

最新推荐文章于 2024-10-28 22:33:48 发布

the_kite_runner___

最新推荐文章于 2024-10-28 22:33:48 发布

阅读量173

点赞数

分类专栏： c++

本文链接：https://blog.csdn.net/u013449590/article/details/123510314

版权

矩阵 c++ leetcode

c++ 专栏收录该内容

6 篇文章 0 订阅

订阅专栏


bool searchtarget(std::vector<vector<int>> vec,int target){
    
    int lenght = vec.size() * vec[0].size() - 1;
    
    int begin =0;
    int end = lenght;
    
    int mid = (begin + end) / 2;
    
    int i = mid / vec[0].size();
    int j = mid % vec[0].size();
    while (begin <= end) {
        
        if(vec[i][j] == target){
            return true;
        }else if(vec[i][j] < target){
            begin = mid+1;
            mid = (begin + end) / 2;
        }else{
            end = mid - 1;
            mid = (begin + end) / 2;
        }
        
        i = mid / vec[0].size();
        j = mid % vec[0].size();
        
    }
    
    return false;
}