704. Binary Search
数组:每次遇到二分法,都是一看就会,一写就废
Given an array of integers nums which is sorted in ascending order, and an integer target,
write a function to search target in nums. If target exists, then return its index.
Otherwise, return -1
You must write an algorithm with O(log n) runtime complexity.
Example 1:
Input: nums = [-1,0,3,5,9,12], target = 9
Output: 4
Explanation: 9 exists in nums and its index is 4
Example 2:
Input: nums = [-1,0,3,5,9,12], target = 2
Output: -1
Explanation: 2 does not exist in nums so return -1
Constraints:
1 <= nums.length <= 104
-104 < nums[i], target < 104
All the integers in nums are unique.
nums is sorted in ascending order.
JAVA实现代码:
class Solution {
public int search(int[] nums, int target) {
int startIndex=0;
int endIndex=nums.length-1;
while(startIndex<=endIndex){
int tempIndex=startIndex+((endIndex-startIndex) >> 1);
System.out.println(tempIndex);
if(nums[tempIndex]==target){
return tempIndex;
}
if(nums[tempIndex]<target){
startIndex=tempIndex+1;
}else{
endIndex=tempIndex-1;
}
}
return -1;
}
}