Add solution #154

Author: JoshCrozier

README.md

@@ -155,6 +155,7 @@
 151|[Reverse Words in a String](./0151-reverse-words-in-a-string.js)|Medium|
 152|[Maximum Product Subarray](./0152-maximum-product-subarray.js)|Medium|
 153|[Find Minimum in Rotated Sorted Array](./0153-find-minimum-in-rotated-sorted-array.js)|Medium|
+154|[Find Minimum in Rotated Sorted Array II](./0154-find-minimum-in-rotated-sorted-array-ii.js)|Hard|
 155|[Min Stack](./0155-min-stack.js)|Medium|
 160|[Intersection of Two Linked Lists](./0160-intersection-of-two-linked-lists.js)|Medium|
 162|[Find Peak Element](./0162-find-peak-element.js)|Medium|

solutions/0154-find-minimum-in-rotated-sorted-array-ii.js

@@ -0,0 +1,31 @@
+/**
+ * 154. Find Minimum in Rotated Sorted Array II
+ * https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/
+ * Difficulty: Hard
+ *
+ * Suppose an array of length n sorted in ascending order is rotated between 1 and n times.
+ * For example, the array nums = [0,1,4,4,5,6,7] might become:
+ * - [4,5,6,7,0,1,4] if it was rotated 4 times.
+ * - [0,1,4,4,5,6,7] if it was rotated 7 times.
+ *
+ * Notice that rotating an array [a[0], a[1], a[2], ..., a[n-1]] 1 time results in the array
+ * [a[n-1], a[0], a[1], a[2], ..., a[n-2]].
+ *
+ * Given the sorted rotated array nums that may contain duplicates, return the minimum element
+ * of this array.
+ *
+ * You must decrease the overall operation steps as much as possible.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var findMin = function(nums) {
+  for (let i = 0; i < nums.length - 1; i++) {
+    if (nums[i] > nums[i + 1]) {
+      return nums[i + 1];
+    }
+  }
+  return nums[0];
+};