Retranslate the complete English edition from Simplified Chinese (#2010)

* Retranslate the complete English edition from Simplified Chinese

* Polish three English explanations after reader-focused review
This commit is contained in:
Yudong Jin
2026-10-31 03:35:51 +08:00
committed by GitHub
parent ef46e2ed95
commit 14c314c08c
1502 changed files with 29459 additions and 23517 deletions

View File

@@ -6,49 +6,49 @@ Author: krahets (krahets@163.com)
def binary_search_insertion_simple(nums: list[int], target: int) -> int:
"""Binary search for insertion point (no duplicate elements)"""
i, j = 0, len(nums) - 1 # Initialize closed interval [0, n-1]
"""Find an insertion point using binary search (no duplicates)"""
i, j = 0, len(nums) - 1 # Initialize the closed interval [0, n-1]
while i <= j:
m = (i + j) // 2 # Calculate midpoint index m
m = (i + j) // 2 # Calculate the midpoint index m
if nums[m] < target:
i = m + 1 # target is in the interval [m+1, j]
i = m + 1 # Target must be in [m+1, j] if it exists
elif nums[m] > target:
j = m - 1 # target is in the interval [i, m-1]
j = m - 1 # Target must be in [i, m-1] if it exists
else:
return m # Found target, return insertion point m
# Target not found, return insertion point i
return m # Target was found; return insertion point m
# Target was not found; return insertion point i
return i
def binary_search_insertion(nums: list[int], target: int) -> int:
"""Binary search for insertion point (with duplicate elements)"""
i, j = 0, len(nums) - 1 # Initialize closed interval [0, n-1]
"""Find an insertion point using binary search (with duplicates)"""
i, j = 0, len(nums) - 1 # Initialize the closed interval [0, n-1]
while i <= j:
m = (i + j) // 2 # Calculate midpoint index m
m = (i + j) // 2 # Calculate the midpoint index m
if nums[m] < target:
i = m + 1 # target is in the interval [m+1, j]
i = m + 1 # Target must be in [m+1, j] if it exists
elif nums[m] > target:
j = m - 1 # target is in the interval [i, m-1]
j = m - 1 # Target must be in [i, m-1] if it exists
else:
j = m - 1 # The rightmost element less than target is in the interval [i, m-1]
j = m - 1 # Continue in [i, m-1] to find the rightmost element smaller than target
# Return insertion point i
return i
"""Driver Code"""
"""Driver code"""
if __name__ == "__main__":
# Array without duplicate elements
# Array with no duplicate elements
nums = [1, 3, 6, 8, 12, 15, 23, 26, 31, 35]
print(f"\nArray nums = {nums}")
# Binary search for insertion point
# Find an insertion point using binary search
for target in [6, 9]:
index = binary_search_insertion_simple(nums, target)
print(f"Index of insertion point for element {target} is {index}")
print(f"Insertion index for element {target}: {index}")
# Array with duplicate elements
# Array containing duplicate elements
nums = [1, 3, 6, 6, 6, 6, 6, 10, 12, 15]
print(f"\nArray nums = {nums}")
# Binary search for insertion point
# Find an insertion point using binary search
for target in [2, 6, 20]:
index = binary_search_insertion(nums, target)
print(f"Index of insertion point for element {target} is {index}")
print(f"Insertion index for element {target}: {index}")