二分查找个人总结,记住这个方法所有二分查找基本秒杀 查找单个元素 特别需要注意三种情况的等号的取值 int binarySearch(int[] nums, int target) { int left = 0; int right = nums.length - 1; // 注意 while(left <= right) { int mid = (right + left) / 2; if(nums[mid] == target) return mid; else if (nums[m...