lintcode:First Position of Target

最新推荐文章于 2020-03-12 21:17:44 发布

martin_liang

最新推荐文章于 2020-03-12 21:17:44 发布

阅读量320

点赞数

分类专栏： C++/C 算法 lintcode

本文链接：https://blog.csdn.net/martin_liang/article/details/50977497

版权

算法同时被 3 个专栏收录

537 篇文章 1 订阅

订阅专栏

C++/C

504 篇文章 0 订阅

订阅专栏

lintcode

66 篇文章 0 订阅

订阅专栏

For a given sorted array (ascending order) and a target number, find the first index of this number in O(log n) time complexity.

If the target number does not exist in the array, return -1.

Have you met this question in a real interview?

Yes

Example

If the array is [1, 2, 3, 3, 4, 5, 10], for given target 3, return 2.

Challenge

If the count of numbers is bigger than 2^32, can your code work properly?

Related Problems

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