add solution of problem 154: find minimum in rotated sorted array II

Author: ppulse

FindMinimumInRotatedSortedArrayII154/README.md

@@ -0,0 +1,13 @@
+> Follow up for "Find Minimum in Rotated Sorted Array":
+> What if duplicates are allowed?
+>
+> Would this affect the run-time complexity? How and why?
+>
+
+Suppose a sorted array is rotated at some pivot unknown to you beforehand.
+
+(i.e., `0 1 2 4 5 6 7` might become `4 5 6 7 0 1 2`).
+
+Find the minimum element.
+
+The array may contain duplicates.

FindMinimumInRotatedSortedArrayII154/Solution.java

@@ -0,0 +1,33 @@
+public class Solution {
+    public int findMin(int[] nums) {
+        if (nums == null || nums.length == 0)
+            return Integer.MIN_VALUE;
+        
+        int numsLen = nums.length;
+        int left = 0;
+        int right = numsLen - 1;
+        
+        if (nums[left] == nums[right]) {
+            int minValue = nums[0];
+            for (int i = 1; i < numsLen; i++) {
+                if (nums[i] < minValue)
+                    minValue = nums[i];
+            }
+            
+            return minValue;
+        } else if (nums[left] < nums[right]) {
+            return nums[left];
+        } else {
+            while (left + 1 < right) {
+                int mid = (left + right) >> 1;
+                if (nums[mid] >= nums[left]) {
+                    left = mid;
+                } else {
+                    right = mid;
+                }
+            }
+            
+            return nums[right];
+        }
+    }
+}