(java)(leecode)34. 在排序数组中查找元素的第一个和最后一个位置

Src:https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/

class Solution {
    public int[] searchRange(int[] nums, int target) {
        int ans[]=new int[2];
        ans[0]=-1;
        ans[1]=-1;
        if(nums.length==0){
            return ans;
        }
        int f=0,t=nums.length-1;
        int m=(f+t)/2;
        int start=-1,end=-1;
        while(f<=t){
            if(nums[m]>target){
                t=m-1;
                m=(f+t)/2;
            }
            else if(nums[m]<target){
                f=m+1;
                m=(f+t)/2;
            }
            if(nums[m]==target){
                   f=m;
                   t=m;
                   start=m;
                   end=m;
                   while(f-1>=0){
                       if(nums[f-1]!=target){
                           start=f;
                           break;
                       }
                       else{
                           start=f-1;
                       }
                       f--;
                   }
                    while(t+1<nums.length){
                        if(nums[t+1]!=target){
                            end=t;
                            break;
                        }
                        else{
                            end=t+1;
                        }
                        t++;
                    }
                    break;
            }
        }
        ans[0]=start;
        ans[1]=end;
        return ans;
    }
}