一、数组1.1二分查找1.1.1关键是要做好边界条件的处理看是左闭右闭 还是 左闭右开有两种写法//左闭右闭 class Solution { public int search(int[] nums, int target) { int min0; int maxnums.length-1; while(minmax){ int middlemin(max-min)/2; if(nums[middle]target) minmiddle1; else if(nums[middle]target) maxmiddle-1; else return middle; } return -1; } }
代码随想录刷题目感想（随机更新）（菜鸡版）
发布时间：2026/6/14 9:36:03
一、数组1.1二分查找1.1.1关键是要做好边界条件的处理看是左闭右闭 还是 左闭右开有两种写法//左闭右闭 class Solution { public int search(int[] nums, int target) { int min0; int maxnums.length-1; while(minmax){ int middlemin(max-min)/2; if(nums[middle]target) minmiddle1; else if(nums[middle]target) maxmiddle-1; else return middle; } return -1; } }
