【Lintcode】14. First Position of Target

题目地址：

https://www.lintcode.com/problem/first-position-of-target/description

给定一个数组，寻找target出现的第一个位置。若不存在则返回$-1$。

直接用二分法即可。代码如下：

public class Solution {
    /**
     * @param nums: The integer array.
     * @param target: Target to find.
     * @return: The first position of target. Position starts from 0.
     */
    public int binarySearch(int[] nums, int target) {
        // write your code here
        if (nums == null || nums.length == 0) {
            return -1;
        }
        
        int l = 0, r = nums.length - 1;
        while (l < r) {
            int m = l + (r - l >> 1);
            if (nums[m] < target) {
                l = m + 1;
            } else if (nums[m] > target) {
                r = m - 1;
            } else {
                r = m;
            }
        }
        
        return nums[l] == target ? l : -1;
    }
}

时间复杂度$O(\log n)$。