mirror of
https://github.com/krahets/hello-algo.git
synced 2026-02-04 03:14:09 +08:00
2778a6f9c7
* 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
55 lines
1.9 KiB
Python
55 lines
1.9 KiB
Python
"""
|
|
File: binary_search_insertion.py
|
|
Created Time: 2023-08-04
|
|
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]
|
|
while i <= j:
|
|
m = (i + j) // 2 # Calculate midpoint index m
|
|
if nums[m] < target:
|
|
i = m + 1 # target is in the interval [m+1, j]
|
|
elif nums[m] > target:
|
|
j = m - 1 # target is in the interval [i, m-1]
|
|
else:
|
|
return m # Found target, return insertion point m
|
|
# Target 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]
|
|
while i <= j:
|
|
m = (i + j) // 2 # Calculate midpoint index m
|
|
if nums[m] < target:
|
|
i = m + 1 # target is in the interval [m+1, j]
|
|
elif nums[m] > target:
|
|
j = m - 1 # target is in the interval [i, m-1]
|
|
else:
|
|
j = m - 1 # The first element less than target is in the interval [i, m-1]
|
|
# Return insertion point i
|
|
return i
|
|
|
|
|
|
"""Driver Code"""
|
|
if __name__ == "__main__":
|
|
# Array without duplicate elements
|
|
nums = [1, 3, 6, 8, 12, 15, 23, 26, 31, 35]
|
|
print(f"\nArray nums = {nums}")
|
|
# Binary search for insertion point
|
|
for target in [6, 9]:
|
|
index = binary_search_insertion_simple(nums, target)
|
|
print(f"Index of insertion point for element {target} is {index}")
|
|
|
|
# Array with duplicate elements
|
|
nums = [1, 3, 6, 6, 6, 6, 6, 10, 12, 15]
|
|
print(f"\nArray nums = {nums}")
|
|
# Binary search for insertion point
|
|
for target in [2, 6, 20]:
|
|
index = binary_search_insertion(nums, target)
|
|
print(f"Index of insertion point for element {target} is {index}")
|