@@ -0,0 +1,240 @@
+package leetcode.find_minimum_in_rotated_sorted_array_ii;%0A%0Apublic class Solution %7B%0A    public int findMin(int%5B%5D num) %7B%0A    %09int min = num%5B0%5D;%0A    %09for(int n : num)%7B%0A    %09%09if(n %3C min)%7B%0A    %09%09%09min = n;%0A    %09%09%7D%0A    %09%7D%0A    %09return min;%0A    %7D%0A%7D%0A

Add java solution for 154. Find Minimum in Rotated Sorted Array II