Merge pull request #1087 from Rahul8691/Rahul8691-patch-1

Added Solution for LeetCode Problem No. 154

Author: Sirajmolla

LeetCode/154. Find Minimum in Rotated Sorted Array II/Solution.java

@@ -0,0 +1,19 @@
+class Solution {
+    public int findMin(int[] nums) {
+        if(nums[0] < nums[nums.length - 1]){
+            return nums[0];
+        }
+        
+        if(nums.length == 1)
+            return nums[0];
+        
+        if(nums[nums.length - 1] < nums[nums.length-2])
+            return nums[nums.length - 1];
+        for(int i = 0; i < nums.length-1; i++){
+            if(nums[i] > nums[i+1])
+                return nums[i+1];
+        }
+    
+        return nums[0];
+    }
+}