34.❤ Find First and Last Position of Element in Sorted Array【在排序数组中查找元素的第一个和最后一个位置】

public static int[] searchRange(int[] nums, int target) {
       int l = 0;
       int r = nums.length-1;
       int result[] = {-1, -1};
       
       //find first position of result
       while (l < r) {
             int mid = l + (r-l)/2;
             
             if (nums[mid] < target) {
                   l = mid + 1;
             } else if (nums[mid] > target) {
                   r = mid - 1;
             } else {
                   r = mid;
             }
       }
       
       if (nums.length == 0 || nums[l] != target) {
             return result;
       } else {
             result[0] = l;
       }
       
       r = nums.length  - 1;
       
       //find second position of result
       while (l < r) {
             int mid = l + (r-l)/2;
             
             if (nums[mid] < target) {
                   l = mid + 1;
             } else if (nums[mid] > target) {
                   r = mid - 1;
             } else {
                   r = mid;
             }
       }
       
       result[1] = l;
       return result;
    }

代码是转自：https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/discuss/362807/0-ms-faster-than-100.00-of-Java-online-submissions