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-09-04 14:17:14 +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.rs
+ * Created Time: 2023-08-30
+ * Author: night-cruise (2586447362@qq.com)
+ */
+
+mod binary_search_insertion;
+
+use binary_search_insertion::binary_search_insertion;
+
+/* Binary search for the leftmost target */
+fn binary_search_left_edge(nums: &[i32], target: i32) -> i32 {
+    // Equivalent to finding the insertion point of target
+    let i = binary_search_insertion(nums, target);
+    // Target not found, return -1
+    if i == nums.len() as i32 || nums[i as usize] != target {
+        return -1;
+    }
+    // Found target, return index i
+    i
+}
+
+/* Binary search for the rightmost target */
+fn binary_search_right_edge(nums: &[i32], target: i32) -> i32 {
+    // Convert to finding the leftmost target + 1
+    let i = binary_search_insertion(nums, target + 1);
+    // j points to the rightmost target, i points to the first element greater than target
+    let j = i - 1;
+    // Target not found, return -1
+    if j == -1 || nums[j as usize] != target {
+        return -1;
+    }
+    // Found target, return index j
+    j
+}
+
+/* Driver Code */
+fn main() {
+    // Array with duplicate elements
+    let nums = [1, 3, 6, 6, 6, 6, 6, 10, 12, 15];
+    println!("\nArray nums = {:?}", nums);
+
+    // Binary search left and right boundaries
+    for target in [6, 7] {
+        let index = binary_search_left_edge(&nums, target);
+        println!("Leftmost element {} index is {}", target, index);
+        let index = binary_search_right_edge(&nums, target);
+        println!("Rightmost element {} index is {}", target, index);
+    }
+}