feat: add solutions to lc problem: No.0704.Binary Search

Author: yanglbme

solution/0700-0799/0704.Binary Search/README.md

@@ -85,13 +85,11 @@ class Solution {
 public:
     int search(vector<int>& nums, int target) {
         int left = 0, right = nums.size() - 1;
-        while (left < right) {
+        while (left < right)
+        {
             int mid = left + right >> 1;
-            if (nums[mid] >= target) {
-                right = mid;
-            } else {
-                left = mid + 1;
-            }
+            if (nums[mid] >= target) right = mid;
+            else left = mid + 1;
         }
         return nums[left] == target ? left : -1;
     }
@@ -118,6 +116,29 @@ func search(nums []int, target int) int {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+ var search = function(nums, target) {
+    let left = 0;
+    let right = nums.length - 1;
+    while (left < right) {
+        const mid = (left + right) >> 1;
+        if (nums[mid] >= target) {
+            right = mid;
+        } else {
+            left = mid + 1;
+        }
+    }
+    return nums[left] == target ? left : -1;
+};
+```
+
 ### **...**
 
 ```

solution/0700-0799/0704.Binary Search/README_EN.md

@@ -79,13 +79,11 @@ class Solution {
 public:
     int search(vector<int>& nums, int target) {
         int left = 0, right = nums.size() - 1;
-        while (left < right) {
+        while (left < right)
+        {
             int mid = left + right >> 1;
-            if (nums[mid] >= target) {
-                right = mid;
-            } else {
-                left = mid + 1;
-            }
+            if (nums[mid] >= target) right = mid;
+            else left = mid + 1;
         }
         return nums[left] == target ? left : -1;
     }
@@ -112,6 +110,29 @@ func search(nums []int, target int) int {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+ var search = function(nums, target) {
+    let left = 0;
+    let right = nums.length - 1;
+    while (left < right) {
+        const mid = (left + right) >> 1;
+        if (nums[mid] >= target) {
+            right = mid;
+        } else {
+            left = mid + 1;
+        }
+    }
+    return nums[left] == target ? left : -1;
+};
+```
+
 ### **...**
 
 ```

solution/0700-0799/0704.Binary Search/Solution.cpp

@@ -2,13 +2,11 @@ class Solution {
 public:
     int search(vector<int>& nums, int target) {
         int left = 0, right = nums.size() - 1;
-        while (left < right) {
+        while (left < right)
+        {
             int mid = left + right >> 1;
-            if (nums[mid] >= target) {
-                right = mid;
-            } else {
-                left = mid + 1;
-            }
+            if (nums[mid] >= target) right = mid;
+            else left = mid + 1;
         }
         return nums[left] == target ? left : -1;
     }

solution/0700-0799/0704.Binary Search/Solution.js

@@ -0,0 +1,18 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+ var search = function(nums, target) {
+    let left = 0;
+    let right = nums.length - 1;
+    while (left < right) {
+        const mid = (left + right) >> 1;
+        if (nums[mid] >= target) {
+            right = mid;
+        } else {
+            left = mid + 1;
+        }
+    }
+    return nums[left] == target ? left : -1;
+};