find minimum in rotated sorted list

Author: chen0040

.idea/workspace.xml

@@ -396,3 +396,4 @@ codes may not be optimized
 1. [Word Frequency](https://leetcode.com/problems/word-frequency/description/)
 1. [Department Highest Salary](https://leetcode.com/problems/department-highest-salary/description/)
 1. [Populating Next Right Pointer in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/description/)
+1. [Find Minimum in Rotated Sorted List](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/)

README.md

@@ -0,0 +1,29 @@
+package com.github.chen0040.leetcode.day18.medium;
+
+
+/**
+ * Created by xschen on 13/8/2017.
+ *
+ * link: https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/
+ */
+public class FindMinimumInRotatedSortedList {
+   public class Solution {
+      public int findMin(int[] nums) {
+         int lo = 0;
+         int hi = nums.length - 1;
+         while(lo <= hi) {
+            int mid = lo + (hi - lo) / 2;
+            if(mid > 0 && nums[mid] < nums[mid-1]) {
+               return nums[mid];
+            }
+            if(nums[lo] <= nums[mid] && nums[mid] > nums[hi]) {
+               lo = mid + 1;
+            } else {
+               hi = mid - 1;
+            }
+         }
+
+         return nums[lo];
+      }
+   }
+}