Leetcode-Solutions-1/MyClass.java at master · rs1820/Leetcode-Solutions-1 · 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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
import java.util.*;

import java.lang.*;

import java.io.*;

public class MyClass {

   public static int count(int[] arr,int low,int high)

   {
        if(high<low)

            return 0;


            if(high==low)

            return low;


           int mid=low+(high-low)/2;


          if (mid < high && arr[mid+1] < arr[mid])

           return (mid + 1);


          if (mid > low && arr[mid] < arr[mid - 1])

            return mid;


          if (arr[high] > arr[mid])

            return count(arr, low, mid - 1);


            return count(arr, mid + 1, high);

}

  public static void main(String args[])
 {
      Scanner sc=new Scanner(System.in);

     int n=sc.nextInt();

 int[] arr=new int[n];

for(int i=0;i<n;i++)

 {
          arr[i]=sc.nextInt();

    }

 System.out.println(count(arr,0,n-1));

 }

}