solve problem Find Minimum In Rotated Sorted Array

Author: P-ppc

README.md

@@ -291,6 +291,7 @@ All solutions will be accepted!
 |890|[Find And Replace Pattern](https://leetcode-cn.com/problems/find-and-replace-pattern/description/)|[java/py/js](./algorithms/FindAndReplacePattern)|Medium|
 |48|[Rotate Image](https://leetcode-cn.com/problems/rotate-image/description/)|[java/py/js](./algorithms/RotateImage)|Medium|
 |74|[Search A 2d Matrix](https://leetcode-cn.com/problems/search-a-2d-matrix/description/)|[java/py/js](./algorithms/SearchA2dMatrix)|Medium|
+|153|[Find Minimum In Rotated Sorted Array](https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/description/)|[java/py/js](./algorithms/FindMinimumInRotatedSortedArray)|Medium|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/FindMinimumInRotatedSortedArray/README.md

@@ -0,0 +1,2 @@
+# Find Minimum In Rotated Sorted Array
+We can solve this problem by binary search

algorithms/FindMinimumInRotatedSortedArray/Solution.java

@@ -0,0 +1,17 @@
+class Solution {
+    public int findMin(int[] nums) {
+        int low = 0,
+            high = nums.length - 1;
+        
+        while (low < high - 1) {
+            int mid = (low + high) / 2;
+            
+            if (nums[mid] < nums[high])
+                high = mid;
+            else if (nums[mid] > nums[high])
+                low = mid;
+        }
+        
+        return Math.min(nums[low], nums[high]);
+    }
+}

algorithms/FindMinimumInRotatedSortedArray/solution.js

@@ -0,0 +1,19 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var findMin = function(nums) {
+    let low = 0,
+        high = nums.length - 1
+    
+    while (low < high - 1) {
+        let mid = parseInt((low + high) / 2)
+        
+        if (nums[mid] < nums[high])
+            high = mid
+        else if (nums[mid] > nums[high])
+            low = mid
+    }
+    
+    return Math.min(nums[low], nums[high])
+};

algorithms/FindMinimumInRotatedSortedArray/solution.py

@@ -0,0 +1,18 @@
+class Solution(object):
+    def findMin(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: int
+        """
+        low = 0
+        high = len(nums) - 1
+        
+        while low < high - 1:
+            mid = (low + high) / 2
+            
+            if nums[mid] < nums[high]:
+                high = mid
+            elif nums[mid] > nums[high]:
+                low = mid
+                
+        return min(nums[low], nums[high])