Add another js solution to leetcode problem: no.0033

Author: lo0b0o

solution/0000-0099/0033.Search in Rotated Sorted Array/README.md

@@ -133,6 +133,34 @@ public:
 };
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+var search = function (nums, target) {
+  let l = 0, r = nums.length - 1;
+  if (l > r) return -1;
+  while (l <= r) {
+    let mid = l + Math.floor((r - l) / 2);
+    if (nums[mid] === target) return mid;
+    else if (nums[mid] <= nums[r] && target <= nums[r] && target >= nums[mid])
+      l = mid + 1;
+    else if (nums[mid] >= nums[l] && target <= nums[mid] && target >= nums[l])
+      r = mid - 1;
+    else if (nums[mid] >= nums[r])
+      l = mid + 1;
+    else if (nums[mid] <= nums[l])
+      r = mid - 1;
+    else return -1;
+  }
+  return -1;
+};
+```
+
 ### **...**
 
 ```

solution/0000-0099/0033.Search in Rotated Sorted Array/README_EN.md

@@ -109,6 +109,34 @@ public:
 };
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+var search = function (nums, target) {
+  let l = 0, r = nums.length - 1;
+  if (l > r) return -1;
+  while (l <= r) {
+    let mid = l + Math.floor((r - l) / 2);
+    if (nums[mid] === target) return mid;
+    else if (nums[mid] <= nums[r] && target <= nums[r] && target >= nums[mid])
+      l = mid + 1;
+    else if (nums[mid] >= nums[l] && target <= nums[mid] && target >= nums[l])
+      r = mid - 1;
+    else if (nums[mid] >= nums[r])
+      l = mid + 1;
+    else if (nums[mid] <= nums[l])
+      r = mid - 1;
+    else return -1;
+  }
+  return -1;
+};
+```
+
 ### **...**
 
 ```

solution/0000-0099/0033.Search in Rotated Sorted Array/Solution.js

@@ -11,3 +11,24 @@ var search = function (nums, target) {
   }
   return -1;
 };
+
+//binary search
+
+var search = function (nums, target) {
+  let l = 0, r = nums.length - 1;
+  if (l > r) return -1;
+  while (l <= r) {
+    let mid = l + Math.floor((r - l) / 2);
+    if (nums[mid] === target) return mid;
+    else if (nums[mid] <= nums[r] && target <= nums[r] && target >= nums[mid])
+      l = mid + 1;
+    else if (nums[mid] >= nums[l] && target <= nums[mid] && target >= nums[l])
+      r = mid - 1;
+    else if (nums[mid] >= nums[r])
+      l = mid + 1;
+    else if (nums[mid] <= nums[l])
+      r = mid - 1;
+    else return -1;
+  }
+  return -1;
+};