@@ -0,0 +1,302 @@
+/**%0A * Problem Link: https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/%0A * %0A */%0Apublic class Solution %7B%0A    public int findMin(int%5B%5D nums) %7B%0A        for(int i=0; i+1%3Cnums.length; i++) %7B%0A            if(nums%5Bi%5D %3E nums%5Bi+1%5D) return nums%5Bi+1%5D;%0A        %7D%0A        return nums%5B0%5D;%0A    %7D%0A%7D%0A

Create Find_Minimum_in_Rotated_Sorted_Array_II.java