@@ -0,0 +1,427 @@
+package leetcode.find_minimum_in_rotated_sorted_array;%0A%0Apublic class Solution %7B%0A    public int findMin(int%5B%5D num) %7B%0A    %09int size = num.length;%0A    %09if(num%5B0%5D %3C= num%5Bsize - 1%5D)%7B // Not rotated%0A    %09%09return num%5B0%5D;%0A    %09%7D%0A    %09int L = -1, U = size;%0A    %09while(L + 1 %3C U)%7B%0A    %09%09int mid = L + (U - L) / 2;%0A    %09%09if(num%5Bmid%5D %3E num%5Bsize - 1%5D)%7B%0A    %09%09%09L = mid;%0A    %09%09%7Delse%7B%0A    %09%09%09U = mid;%0A    %09%09%7D%0A    %09%7D%0A    %09return num%5BU%5D;%0A    %7D%0A%7D

Add java solution for 153. Find Minimum in Rotated Sorted Array