Translate all code to English (#1836)

* Review the EN heading format. * Fix pythontutor headings. * Fix pythontutor headings. * bug fixes * Fix headings in **/summary.md * Revisit the CN-to-EN translation for Python code using Claude-4.5 * Revisit the CN-to-EN translation for Java code using Claude-4.5 * Revisit the CN-to-EN translation for Cpp code using Claude-4.5. * Fix the dictionary. * Fix cpp code translation for the multipart strings. * Translate Go code to English. * Update workflows to test EN code. * Add EN translation for C. * Add EN translation for CSharp. * Add EN translation for Swift. * Trigger the CI check. * Revert. * Update en/hash_map.md * Add the EN version of Dart code. * Add the EN version of Kotlin code. * Add missing code files. * Add the EN version of JavaScript code. * Add the EN version of TypeScript code. * Fix the workflows. * Add the EN version of Ruby code. * Add the EN version of Rust code. * Update the CI check for the English version code. * Update Python CI check. * Fix cmakelists for en/C code. * Fix Ruby comments
2026-08-14 12:40:58 +00:00 · 2025-12-31 07:44:52 +08:00
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
@@ -0,0 +1,50 @@
+/**
+* File: binary_search_edge.cs
+* Created Time: 2023-08-06
+* Author: hpstory (hpstory1024@163.com)
+*/
+
+namespace hello_algo.chapter_searching;
+
+public class binary_search_edge {
+    /* Binary search for the leftmost target */
+    int BinarySearchLeftEdge(int[] nums, int target) {
+        // Equivalent to finding the insertion point of target
+        int i = binary_search_insertion.BinarySearchInsertion(nums, target);
+        // Target not found, return -1
+        if (i == nums.Length || nums[i] != target) {
+            return -1;
+        }
+        // Found target, return index i
+        return i;
+    }
+
+    /* Binary search for the rightmost target */
+    int BinarySearchRightEdge(int[] nums, int target) {
+        // Convert to finding the leftmost target + 1
+        int i = binary_search_insertion.BinarySearchInsertion(nums, target + 1);
+        // j points to the rightmost target, i points to the first element greater than target
+        int j = i - 1;
+        // Target not found, return -1
+        if (j == -1 || nums[j] != target) {
+            return -1;
+        }
+        // Found target, return index j
+        return j;
+    }
+
+    [Test]
+    public void Test() {
+        // Array with duplicate elements
+        int[] nums = [1, 3, 6, 6, 6, 6, 6, 10, 12, 15];
+        Console.WriteLine("\nArray nums = " + nums.PrintList());
+
+        // Binary search left and right boundaries
+        foreach (int target in new int[] { 6, 7 }) {
+            int index = BinarySearchLeftEdge(nums, target);
+            Console.WriteLine("Leftmost element " + target + " has index " + index);
+            index = BinarySearchRightEdge(nums, target);
+            Console.WriteLine("Rightmost element " + target + " has index " + index);
+        }
+    }
+}