zoukankan      html  css  js  c++  java
  • leetcode(74)搜索二维矩阵

    搜索二维矩阵

    解题思路:两次二分法查找

    class Solution {
        public boolean searchMatrix(int[][] matrix, int target) {
            if(matrix.length==0||matrix[0].length==0){
                return false;
            }
            int xlen = matrix.length;
            int ylen = matrix[0].length;
            int start = 0;
            int end = xlen - 1;
            int mid = 0;
            int start2 = 0;
            int end2 = ylen - 1;
            while(start<=end){
                mid = (start+end)/2;
                if(matrix[mid][0]==target){
                    return true;
                }else if(matrix[mid][0]>target){
                    end = mid - 1;
                }else{
                    start = mid + 1;
                }
            }
            if(end==-1){
                return false;
            }
            while(start2<=end2){
                mid = (start2+end2)/2;
                if(matrix[end][mid]==target){
                    return true;
                }else if(matrix[end][mid]>target){
                    end2 = mid - 1;
                }else{
                    start2 = mid + 1;
                }
            }
            return false;  
        }  
    }
  • 相关阅读:
    zap日志库
    Go Logger库基本使用
    golang中的MySQL增删改查
    golang链接mysql
    文件上傳
    參數綁定:
    gin獲取path參數
    gin獲取form提交的表單數據
    獲取query string
    返回json
  • 原文地址:https://www.cnblogs.com/erdanyang/p/11272253.html
Copyright © 2011-2022 走看看