Find Minimum in Rotated Sorted Array LeetCode solution in Java

1
class Solution {
2
  public int findMin(int[] nums) {
3
    int min = nums[0];
4

5
    for (int i = 0; i < nums.length; i++) {
6
      if (min > nums[i]) {
7
        min = nums[i];
8
      }
9
    }
10
    return min;
11
  }
12
}