转702 Search in a Sorted Array of Unknown Size

Given 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.

Notice

If you accessed an inaccessible index (outside of the array), ArrayReader.get will return 2,147,483,647.

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

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

解题思路: 
this problems should be use binary search algorithm, and if you can’t get the idea you can think about the thesis about the binary algorithm.

/**
 * Definition of ArrayReader:
 * 
 * class ArrayReader {
 *      // get the number at index, return -1 if index is less than zero.
 *      public int get(int index);
 * }
 */
public class Solution {
    /**
     * @param reader: An instance of ArrayReader.
     * @param target: An integer
     * @return : An integer which is the index of the target number
     */
    public int searchBigSortedArray(ArrayReader reader, int target) {
        // write your code here
        if (reader == null) {
            return -1;
        }
        int index = 1;
        while (reader.get(index) < target) {
            index *= 2;
        }
        int start = 0;
        int end = index;
        while (start + 1 < end) {
            int mid = start + (end - start) / 2;
            if (reader.get(mid) == target) {
                end = mid;
            } else if (reader.get(mid) < target) {
                start = mid;
            } else {
                end = mid;
            }
        }
        if (reader.get(start) == target) {
            return start;
        }
        if (reader.get(end) == target) {
            return end;
        }
        return -1;
    }
}
--------------------- 
作者：ncst 
来源：CSDN 
原文：https://blog.csdn.net/sinat_32547403/article/details/54644925 
版权声明：本文为博主原创文章，转载请附上博文链接！