算法面试——二分查找:旋转数组、二维矩阵、边界
一、基础二分
public int binarySearch(int[] nums, int target) {int left 0, right nums.length - 1;while (left < right) {int mid left (right - left) / 2;if (nums[mid] target) return mid;if (nums[mid] < target) left mid 1;else right mid - 1;}retu…
2026/8/10 12:50:32