二分查找
二分查找
fengzhengwszz
这个作者很懒,什么都没留下…
展开
-
240搜索二维矩阵2
1、二分查找,每行二分// public boolean searchMatrix(int[][] matrix, int target) { // //每层二分 // if (matrix == null || matrix.length == 0) return false; // for (int i = 0; i < matrix.length; i++) { // //每层二分 // in原创 2021-08-26 16:21:43 · 168 阅读 · 0 评论 -
leetcode 74搜索二维矩阵
class Solution { public boolean searchMatrix(int[][] matrix, int target) { /*两次二分查找*/ //首先判断在哪一行 int rowup = 0; int rowDown = matrix.length - 1; int x = -1; while (rowup <= rowDown){ int mi原创 2021-05-15 11:30:51 · 67 阅读 · 0 评论 -
leetcode 162 寻找峰值
public int findPeakElement(int[] nums) {//二分查找法 if(nums.length == 1){ return 0; } int left = 0; int rigth = nums.length - 1; while(left < rigth){ int mid = (left + rigth) / 2; ..原创 2021-05-15 11:00:19 · 42 阅读 · 0 评论