wsy182
/
Solution
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update BinarySearch.java

master
wangsiyuan 2024-07-09 23:58:32 +08:00
parent 664b4478d7
commit 7827051d82
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
src/main/java/com/nbee/solution/practice/BinarySearch.java
View File

@ -4,7 +4,8 @@ class BinarySearch {
public static int binarySearchBasic(int[] nums, int target){ public static int binarySearchBasic(int[] nums, int target){
int i = 0 ,j = nums.length - 1;//设置指针和初始值 int i = 0 ,j = nums.length - 1;//设置指针和初始值
while (i <= j){//此处的条件是i<=j，而不是i<j， while (i <= j){//此处的条件是i<=j，而不是i<j，
int m = ((i + j) / 2); // int m = ((i + j) / 2);
int m = (i + j) >>> 1; //按位右移补零操作符。相当于除2，解决溢出问题
if (target < nums[m]){//如果中间值大于目标值，则将右指针向左移动 if (target < nums[m]){//如果中间值大于目标值，则将右指针向左移动
j = m - 1; j = m - 1;
} }