Basic algorithms and template

README.md

@@ -37,14 +37,13 @@
 - [冒泡排序](./basic/sorting/BubbleSort/README.md)
 - [插入排序](./basic/sorting/InsertionSort/README.md)
 - [选择排序](./basic/sorting/SelectionSort/README.md)
-- [归并排序](./basic/sorting/MergeSort/README.md)
-- [快速排序](./basic/sorting/QuickSort/README.md)
+- [归并排序（算法模板）](./basic/sorting/MergeSort/README.md)
+- [快速排序（算法模板）](./basic/sorting/QuickSort/README.md)
 - [希尔排序](./basic/sorting/ShellSort/README.md)
 
 ### 查找算法
 
-- [二分查找](./basic/searching/BinarySearch/README.md)
-- [二分查找 II](./basic/searching/BinarySearch-II/README.md)
+- [二分查找（算法模板）](./basic/searching/BinarySearch/README.md)
 
 ## 高频考题
 

README_EN.md

@@ -37,14 +37,13 @@ Complete solutions to [LeetCode](https://leetcode-cn.com/problemset/all/), [LCOF
 - [Bubble Sort](./basic/sorting/BubbleSort/README.md)
 - [Insertion Sort](./basic/sorting/InsertionSort/README.md)
 - [Selection Sort](./basic/sorting/SelectionSort/README.md)
-- [Merge Sort](./basic/sorting/MergeSort/README.md)
-- [Quick Sort](./basic/sorting/QuickSort/README.md)
+- [Merge Sort(Algorithm Template)](./basic/sorting/MergeSort/README.md)
+- [Quick Sort(Algorithm Template)](./basic/sorting/QuickSort/README.md)
 - [Shell Sort](./basic/sorting/ShellSort/README.md)
 
 ### Searching
 
-- [Binary Search](./basic/searching/BinarySearch/README.md)
-- [Binary Search II](./basic/searching/BinarySearch-II/README.md)
+- [Binary Search(Algorithm Template)](./basic/searching/BinarySearch/README.md)
 
 ## High Frequency Interview Questions
 

basic/README.md

@@ -11,4 +11,3 @@
 ## 查找算法
 
 - [二分查找](./searching/BinarySearch/README.md)
-- [二分查找 II](./searching/BinarySearch-II/README.md)

basic/README_EN.md

@@ -12,4 +12,3 @@
 ## Searching
 
 - [Binary Search](./searching/BinarySearch/README.md)
-- [Binary Search II](./searching/BinarySearch-II/README.md)

basic/searching/BinarySearch/Main.java

@@ -0,0 +1,40 @@
+import java.util.Scanner;
+
+public class Main {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt(), q = sc.nextInt();
+        int[] nums = new int[n];
+        for (int i = 0; i < n; ++i) {
+            nums[i] = sc.nextInt();
+        }
+        while (q-- > 0) {
+            int x = sc.nextInt();
+            int left = 0, right = n - 1;
+            while (left < right) {
+                int mid = (left + right) >> 1;
+                if (nums[mid] >= x) {
+                    right = mid;
+                } else {
+                    left = mid + 1;
+                }
+            }
+            if (nums[left] != x) {
+                System.out.println("-1 -1");
+            } else {
+                int t = left;
+                left = 0;
+                right = n - 1;
+                while (left < right) {
+                    int mid = (left + right + 1) >> 1;
+                    if (nums[mid] <= x) {
+                        left = mid;
+                    } else {
+                        right = mid - 1;
+                    }
+                }
+                System.out.printf("%d %d\n", t, left);
+            }
+        }
+    }
+}

basic/searching/BinarySearch/Main.py

@@ -0,0 +1,24 @@
+n, q = map(int, input().split())
+nums = list(map(int, input().split()))
+
+for _ in range(q):
+    x = int(input())
+    left, right = 0, n - 1
+    while left < right:
+        mid = (left + right) >> 1
+        if nums[mid] >= x:
+            right = mid
+        else:
+            left = mid + 1
+    if nums[left] != x:
+        print('-1 -1')
+    else:
+        t = left
+        left, right = 0, n - 1
+        while left < right:
+            mid = (left + right + 1) >> 1
+            if nums[mid] <= x:
+                left = mid
+            else:
+                right = mid - 1
+        print(f'{t} {left}')