二分查找 lintcode

描述

给定一个排序的整数数组（升序）和一个要查找的整数target，用O(logn)的时间查找到target第一次出现的下标（从0开始），如果target不存在于数组中，返回-1。

样例

在数组 [1, 2, 3, 3, 4, 5, 10] 中二分查找3，返回2。

class Solution {
public:
    /**
     * @param nums: The integer array.
     * @param target: Target to find.
     * @return: The first position of target. Position starts from 0.
     */
    int binarySearch(vector<int> &nums, int target) {
        // write your code heret
        int mid,start,end;
        if(nums.empty())
            return -1;
        start = 0;
        end = nums.size()-1;
        while(start <= end){
            mid = start + (end - start)/2;
            if(nums[mid] == target){
                if(nums[mid - 1] != target)
                return mid;
                while(mid > 0)
                {
                    mid--;
                    if((nums[mid] == target) && (nums[mid - 1] != target))
                    return mid;
                }
            }
            else if(nums[mid] > target)
                end = mid - 1;
            else if(nums[mid] < target)
                start = mid + 1;
        }
        return  -1;
        
    }
};