leetcode算法学习记录之-----二分查找

话不多说直接上代码
leetcode 3道二分查找的题
先总结：二分查找的特点：
1.时间复杂度为 O(log n) 的算法。
2.排序数组nums，目标值target。
3.每次查找分一半。比较nums[mid]和target的大小。
704：二分查找
class Solution{
public int search(int[] nums, int target){
int left = 0;
int right = nums.length - 1;
while(left <= right) //进行循环递归
{
int mid = (right - left)/2 + left; //防止溢出
int num = nums[mid];
if(num == target){
return mid;
}else if(num > target){
right = mid - 1;
}else{
left = mid + 1;
}
}
return -1;
}
}

278.第一个错误的版本
/* The isBadVersion API is defined in the parent class VersionControl.
boolean isBadVersion(int version); */

public class Solution extends VersionControl {
public int firstBadVersion(int n) {
int left = 1;
int right = n;
// 循环至左右边界相等
while (left < right){
int mid = (right - left)/2 + left;
if(isBadVersion(mid)){
// 答案在[left，mid]区间
right = mid;
}else{
// 答案在[mid+1，right]区间
left = mid + 1;
}
}
// 此时mid=right 趋于一个点
return left;
}
}

35.搜索插入位置：
class Solution {
public int searchInsert(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
while(left <= right){
int mid = (right - left)/2 + left;
int num = nums[mid];
if(num == target){
return mid;
}else if(num > target){
right = mid - 1;
}else{
left = mid + 1;
}
}
return left;
}
}