feat: add binary search examples

Author: yanglbme

basic/searching/BinarySearch/README.md

@@ -31,4 +31,7 @@ int binarySearch2(int left, int right) {
 
 ## 例题
 
-- [在排序数组中查找元素的第一个和最后一个位置](/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README.md)
+- [在排序数组中查找元素的第一个和最后一个位置](/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README.md)
+- [寻找峰值](/solution/0100-0199/0162.Find%20Peak%20Element/README.md)
+- [第一个错误的版本](/solution/0200-0299/0278.First%20Bad%20Version/README.md)
+- [不动点](/solution/1000-1099/1064.Fixed%20Point/README.md)

basic/searching/BinarySearch/README_EN.md

@@ -29,4 +29,7 @@ int binarySearch2(int left, int right) {
 
 ## Examples
 
-- [Find First and Last Position of Element in Sorted Array](/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README_EN.md)
+- [Find First and Last Position of Element in Sorted Array](/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README_EN.md)
+- [Find Peak Element](/solution/0100-0199/0162.Find%20Peak%20Element/README_EN.md)
+- [First Bad Version](/solution/0200-0299/0278.First%20Bad%20Version/README_EN.md)
+- [Fixed Point](/solution/1000-1099/1064.Fixed%20Point/README_EN.md)

index.html

@@ -105,6 +105,7 @@
   <script src="//cdn.jsdelivr.net/npm/prismjs/components/prism-javascript.min.js"></script>
   <script src="//cdn.jsdelivr.net/npm/prismjs/components/prism-typescript.min.js"></script>
   <script src="//cdn.jsdelivr.net/npm/prismjs/components/prism-python.min.js"></script>
+  <script src="//cdn.jsdelivr.net/npm/prismjs/components/prism-swift.min.js"></script>
   <script src="//cdn.jsdelivr.net/npm/docsify-copy-code@2.1.1/dist/docsify-copy-code.min.js"></script>
   <script src="//cdn.jsdelivr.net/npm/docsify/lib/plugins/search.min.js"></script>
   <script src="//cdn.jsdelivr.net/npm/docsify/lib/plugins/emoji.min.js"></script>

solution/0000-0099/0001.Two Sum/README_EN.md

@@ -93,6 +93,7 @@ var twoSum = function (nums, target) {
   return [];
 };
 ```
+
 ### **Swift**
 
 ```swift

solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/README.md

@@ -94,6 +94,7 @@ class Solution {
         if (nums.length == 0) {
             return new int[]{-1, -1};
         }
+        // find first position
         int left = 0, right = nums.length - 1;
         while (left < right) {
             int mid = (left + right) >>> 1;
@@ -107,6 +108,8 @@ class Solution {
             return new int[]{-1, -1};
         }
         int l = left;
+
+        // find last position
         right = nums.length - 1;
         while (left < right) {
             int mid = (left + right + 1) >>> 1;

solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/README_EN.md

@@ -72,6 +72,7 @@ class Solution {
         if (nums.length == 0) {
             return new int[]{-1, -1};
         }
+        // find first position
         int left = 0, right = nums.length - 1;
         while (left < right) {
             int mid = (left + right) >>> 1;
@@ -85,6 +86,8 @@ class Solution {
             return new int[]{-1, -1};
         }
         int l = left;
+
+        // find last position
         right = nums.length - 1;
         while (left < right) {
             int mid = (left + right + 1) >>> 1;

solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/Solution.java

@@ -3,6 +3,7 @@ public int[] searchRange(int[] nums, int target) {
         if (nums.length == 0) {
             return new int[]{-1, -1};
         }
+        // find first position
         int left = 0, right = nums.length - 1;
         while (left < right) {
             int mid = (left + right) >>> 1;
@@ -16,6 +17,8 @@ public int[] searchRange(int[] nums, int target) {
             return new int[]{-1, -1};
         }
         int l = left;
+
+        // find last position
         right = nums.length - 1;
         while (left < right) {
             int mid = (left + right + 1) >>> 1;

solution/0200-0299/0278.First Bad Version/README.md

@@ -47,14 +47,14 @@ class Solution:
         :type n: int
         :rtype: int
         """
-        low, high = 1, n
-        while low < high:
-            mid = (low + high) >> 1
+        left, right = 1, n
+        while left < right:
+            mid  = (left + right) >> 1
             if isBadVersion(mid):
-                high = mid
+                right = mid
             else:
-                low = mid + 1
-        return low
+                left = mid + 1
+        return left
 ```
 
 ### **Java**
@@ -67,13 +67,16 @@ class Solution:
 
 public class Solution extends VersionControl {
     public int firstBadVersion(int n) {
-        int low = 1, high = n;
-        while (low < high) {
-            int mid = (low + high) >>> 1;
-            if (isBadVersion(mid)) high = mid;
-            else low = mid + 1;
+        int left = 1, right = n;
+        while (left < right) {
+            int mid = (left + right) >>> 1;
+            if (isBadVersion(mid)) {
+                right = mid;
+            } else {
+                left = mid + 1;
+            }
         }
-        return low;
+        return left;
     }
 }
 ```
@@ -87,16 +90,16 @@ public class Solution extends VersionControl {
 class Solution {
 public:
     int firstBadVersion(int n) {
-        int low = 1, high = n;
-        while (low < high) {
-            int mid = low + (high - low) / 2;
+        int left = 1, right = n;
+        while (left < right) {
+            int mid = left + ((right - left) >> 1);
             if (isBadVersion(mid)) {
-                high = mid;
+                right = mid;
             } else {
-                low = mid + 1;
+                left = mid + 1;
             }
         }
-        return low;
+        return left;
     }
 };
 ```
@@ -106,7 +109,7 @@ public:
 ```js
 /**
  * Definition for isBadVersion()
- *
+ * 
  * @param {integer} version number
  * @return {boolean} whether the version is bad
  * isBadVersion = function(version) {
@@ -118,49 +121,49 @@ public:
  * @param {function} isBadVersion()
  * @return {function}
  */
-var solution = function (isBadVersion) {
-  /**
-   * @param {integer} n Total versions
-   * @return {integer} The first bad version
-   */
-  return function (n) {
-    let low = 1,
-      high = n;
-    while (low < high) {
-      const mid = (low + high) >>> 1;
-      if (isBadVersion(mid)) {
-        high = mid;
-      } else {
-        low = mid + 1;
-      }
-    }
-    return low;
-  };
+var solution = function(isBadVersion) {
+    /**
+     * @param {integer} n Total versions
+     * @return {integer} The first bad version
+     */
+    return function(n) {
+        let left = 1;
+        let right = n;
+        while (left < right) {
+            const mid = (left + right) >>> 1;
+            if (isBadVersion(mid)) {
+                right = mid;
+            } else {
+                left = mid + 1;
+            }
+        }
+        return left;
+    };
 };
 ```
 
 ### **Go**
 
 ```go
-/** 
+/**
  * Forward declaration of isBadVersion API.
  * @param   version   your guess about first bad version
- * @return 	 	      true if current version is bad 
+ * @return 	 	      true if current version is bad
  *			          false if current version is good
  * func isBadVersion(version int) bool;
  */
 
 func firstBadVersion(n int) int {
-    low, high := 1, n
-    for low < high {
-        mid := (low + high) >> 1
-        if isBadVersion(mid) {
-            high = mid
-        } else {
-            low = mid + 1
-        }
-    }
-    return low
+	left, right := 1, n
+	for left < right {
+		mid := (left + right) >> 1
+		if isBadVersion(mid) {
+			right = mid
+		} else {
+			left = mid + 1
+		}
+	}
+	return left
 }
 ```