AlgorithmsOptimized/Firstandlastposition.java at main · mansikamal19/AlgorithmsOptimized · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
import java.util.Arrays;
public class Firstandlastposition {
    public static void main(String[] args) {
      int[] arr={5,7,7,7,7,8,8,10};
        int target=7;
        System.out.println(Arrays.toString(range(arr,target)));
    }
     public   static int[] range(int[] nums,int target)
    {

        int[] ans={-1,-1};
        int start=Search(nums,target,true);
        int end=Search(nums,target,false);
        ans[0]=start;
        ans[1]=end;
        return ans;


    }
    static int Search(int[] nums,int target,boolean firstindex)
        {
            int ans=-1;
            int start=0;
            int end=nums.length-1;
            while (start<end)
            {
                int mid=start+(end-start)/2;
                if(target<nums[mid])
                    end=mid-1;
                if (target>nums[mid])
                    start=mid+1;
                else {
                    ans=mid;
                    if(firstindex)
                        end=mid-1;
                    else
                        start=mid+1;
                }
            }
            return ans;
        }


}