34. Find First and Last Position of Element in Sorted Array

Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value.

Your algorithm’s runtime complexity must be in the order of O(log n).

If the target is not found in the array, return [-1, -1].

Example 1:

Input: nums = [5,7,7,8,8,10], target = 8
Output: [3,4]

Example 2:

Input: nums = [5,7,7,8,8,10], target = 6
Output: [-1,-1]

public class Solution {  
    public int[] searchRange(int[] nums, int target) {
        int[] res = {-1, -1};
        int max = Integer.MIN_VALUE;
        int i = 0;
        for (i=0; i<nums.length; i++) {
            if (nums[i] > max) {
                max = nums[i]; 
                if (max == target)
                    res[0] = i;
                if (max > target && res[0] != -1) {
                    break;
                }
            }
        }
        if (res[0] != -1)
            res[1] = i-1;
        return res;
    }
}