Auto Update@2019-04-1417:52:36.00

Author: Mutoune

Solutions/153FindMinimuminRotatedSortedArray.java

@@ -0,0 +1,20 @@
+
+public class Solution {
+    
+    public int findMin(int[] nums) {
+        int min = nums[0];
+        for (int i = 0; i < nums.length; i++) {
+            if (min > nums[i]) {
+                min = nums[i];
+                break;
+            }
+        }
+        return min;
+    }
+
+    public static void main(String[] args) {
+        int[] nums = {4,5,6,7,0,1,2};
+        System.out.println(new Solution().findMin(nums));
+    }
+
+}