Add solution #81

Author: JoshCrozier

README.md

@@ -76,6 +76,7 @@
 77|[Combinations](./0077-combinations.js)|Medium|
 78|[Subsets](./0078-subsets.js)|Medium|
 80|[Remove Duplicates from Sorted Array II](./0080-remove-duplicates-from-sorted-array-ii.js)|Medium|
+81|[Search in Rotated Sorted Array II](./0081-search-in-rotated-sorted-array-ii.js)|Medium|
 83|[Remove Duplicates from Sorted List](./0083-remove-duplicates-from-sorted-list.js)|Easy|
 86|[Partition List](./0086-partition-list.js)|Medium|
 88|[Merge Sorted Array](./0088-merge-sorted-array.js)|Easy|

solutions/0081-search-in-rotated-sorted-array-ii.js

@@ -0,0 +1,28 @@
+/**
+ * 81. Search in Rotated Sorted Array II
+ * https://leetcode.com/problems/search-in-rotated-sorted-array-ii/
+ * Difficulty: Medium
+ *
+ * There is an integer array nums sorted in non-decreasing order (not
+ * necessarily with distinct values).
+ *
+ * Before being passed to your function, nums is rotated at an unknown
+ * pivot index k (0 <= k < nums.length) such that the resulting array
+ * is [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]]
+ * (0-indexed). For example, [0,1,2,4,4,4,5,6,6,7] might be rotated at pivot
+ * index 5 and become [4,5,6,6,7,0,1,2,4,4].
+ *
+ * Given the array nums after the rotation and an integer target, return
+ * true if target is in nums, or false if it is not in nums.
+ *
+ * You must decrease the overall operation steps as much as possible.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {boolean}
+ */
+var search = function(nums, target) {
+  return nums.includes(target);
+};