Leetcode-Basic/MinimumInRotated.java at main · kavya-7777/Leetcode-Basic · 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
<<<<<<< HEAD
//153. Find Minimum in Rotated Sorted Array

class Solution {
    public int findMin(int[] nums) {
        int left = 0, right = nums.length - 1;
        while(left < right){
            int mid = left + (right - left) / 2;
            if(nums[mid] > nums[right]) left = mid + 1;
            else right = mid;
        }
        return nums[left];
    }
}

// class Solution {
//     public int findMin(int[] nums) {
//         int min = nums[0];
//         for(int i=0;i<nums.length;i++){
//             min = Math.min(min, nums[i]);
//         }
//         return min;
//     }
=======
//153. Find Minimum in Rotated Sorted Array

class Solution {
    public int findMin(int[] nums) {
        int left = 0, right = nums.length - 1;
        while(left < right){
            int mid = left + (right - left) / 2;
            if(nums[mid] > nums[right]) left = mid + 1;
            else right = mid;
        }
        return nums[left];
    }
}

// class Solution {
//     public int findMin(int[] nums) {
//         int min = nums[0];
//         for(int i=0;i<nums.length;i++){
//             min = Math.min(min, nums[i]);
//         }
//         return min;
//     }
>>>>>>> be6ce0b427078b1421d5dd74adb2300dc02daeec
// }