2——二分法

二分法模板

class Solution {
    /*
    @param nums: An interger array sorted in ascending order
    @param target: An interger
    @return an integer
    */
    public int lastPosition(int[] nums, int target) {
        if (nums == null || nums.length == 0){
            return -1;
        }
        
        int start = 0,end = nums.length - 1;
        while(start + 1 < end{
            int mid = start + (end - start) / 2;
            if(nums[mid] == target){
                end = mid;
            }else if(nums[mid] < target){
                start = mid;
            }else{
                end = mid;
            }
        }
        
        if (nums[end] == target){
            return end;
        }
        if (nums[start] == target){
            return start;
        }
        return -1;
    }
}

很长的数组

先确定数组的初始长度，如果不够就乘二；double

lintcode 447 Search in a Big Sorted Array

a big sorted array with positive integers sorted by ascending order. The array is so big so that you can not get the length of the whole array directly, and you can only access the kth number by ArrayReader.get(k) (or ArrayReader->get(k) for C++). Find the first index of a target number. Your algorithm should be in O(log k), where k is the first index of the target number.
Return -1, if the number doesn’t exist in the array.

Example

Given [1, 3, 6, 9, 21, …], and target = 3, return 1.
Given [1, 3, 6, 9, 21, …], and target = 4, return -1.

分析：

给一个按照升序排序的正整数数组。这个数组很大以至于你只能通过固定的接口ArrayReader.get(k) 来访问第k个数。(或者C++里是ArrayReader->get(k))，并且你也没有办法得知这个数组有多大。找到给出的整数target第一次出现的位置。你的算法需要在O(logk)的时间复杂度内完成，k为target第一次出现的位置的下标。
如果找不到target，返回-1。

class Solution {
    /*
    * @param reader: An instance of ArrayReader can read number by integer
    * @param target: An integer
    * @return : An integer which is the index of the target number 
    */
    public int searchBigSortedArray(ArrayReader reader, int target) {
        //Algorithem:
        //1.get the index that ArrayReader.get(count) >= target in
        //O(logk)
        //Binary search the target betweem 0 and index
        
        int index = 1;
        // >= target
        
        //ArrayReader.get(k)可以获取数组 k位置的值
        while(reader.get(count - 1) < target){
            count = count * 2;
        }
        
        int start = count / 2,end = count - 1;
        while(start + 1 < end ){
            int mid = start + (end - start) / 2;
            if(reader.get(mid) < target){
            start = mid;
            }else{
                end = mid;
            }
        }
        if(reader.get(start) == target)
        {return start;}
        
            
         if(reader.get(end) == target)
        {return end;}
        
    }
}

Search in rotated sorted array

give you a target,and you should find the location of the target in array;
EX:45670123
find 6;
print:3
如何用一次二分解决？

public class Solution {
	while int search(int[] A, int target)
		  if (A == null || A.length == 0){
            return -1;
        }
    int start = 0;
    int end = A.length - 1;
    int mid;
while(start + 1 < mid ){
	mid = start + (end - start) / 2;
	if (A[mid] == target)
		return mid;
	if (A[start] < A[mid]){
		//case 1,red line
		if(target > start && target < mid)
			end = mid;
		else
			start = mid;
	else
	//case 2,
		if(target > mid && target < end)
			start = mid;
		else
			end = mid;
	}
if (A[end] == target){
           return end;
       }
       if (A[start] == target){
           return start;
       }
       return -1;
}