@@ -0,0 +1,336 @@
+package leetcode;%0A%0A/**%0A * https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/%0A */%0Apublic class Problem153 %7B%0A    public int findMin(int%5B%5D nums) %7B%0A        int min = nums%5B0%5D;%0A        for (int n : nums) %7B%0A            if (n %3C min) %7B%0A                min = Math.min(n, min);%0A            %7D%0A        %7D%0A        return min;%0A    %7D%0A%7D%0A

Solve problem 153 (it's not log N yet)