LeetCode刷题day035 (Jieky)

LeetCode第35题 Search Insert Position

/*
题目 #
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array.

Example 1:
Input: [1,3,5,6], 5
Output: 2

Example 2:
Input: [1,3,5,6], 2
Output: 1

Example 3:
Input: [1,3,5,6], 7
Output: 4

Example 4:
Input: [1,3,5,6], 0
Output: 0
*/

public class SearchInsertPosition{
	public static void main(String[] args){
		int nums[] = {1,3,5,6};
		SearchInsertPosition sip = new SearchInsertPosition();
		int result = sip.searchInsert(nums,4);
		System.out.println(result);
	}
	
	public int searchInsert(int[] nums, int target) {
        if (nums.length == 0) return 0;
		
		int start = 0;
		int end = nums.length-1;
		
		while(start <= end){
			int mid = (start+end)/2;
			if(nums[mid] == target) {
				return mid;
			}else if(target < nums[mid]){
				end = mid - 1;
			}else{
				start = mid + 1;
			}
			
			// mid - 1 和 mid + 1 必须有一个，打破僵局
		}
		
		return start;
    }
	
	public int searchInsert01(int[] nums, int target) {
        if (nums.length == 0) return 0;
		
		int start = 0;
		int end = nums.length-1;
		
		while(start <= end){
			int mid = (start+end)/2;
			if(nums[mid] == target) {
				return mid;
			}else if(target < nums[mid]){
				end = mid - 1;
			}else{
				start = mid + 1;
			}
			
			// mid - 1 和 mid + 1 必须有一个，打破僵局
		}
		
		if (target < nums[start]){
			return start;
		}else if (target > nums[start]){
			return start + 1;
		}else{
            return start;
        }
    }
}