You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
69 lines
2.3 KiB
69 lines
2.3 KiB
/**
|
|
* File: binary_search_insertion.c
|
|
* Created Time: 2023-09-09
|
|
* Author: Gonglja (glj0@outlook.com)
|
|
*/
|
|
|
|
#include "../utils/common.h"
|
|
|
|
/* 二分查找插入点（无重复元素） */
|
|
int binarySearchInsertionSimple(int *nums, int numSize, int target) {
|
|
int i = 0, j = numSize - 1; // 初始化双闭区间 [0, n-1]
|
|
while (i <= j) {
|
|
int m = i + (j - i) / 2; // 计算中点索引 m
|
|
if (nums[m] < target) {
|
|
i = m + 1; // target 在区间 [m+1, j] 中
|
|
} else if (nums[m] > target) {
|
|
j = m - 1; // target 在区间 [i, m-1] 中
|
|
} else {
|
|
return m; // 找到 target ，返回插入点 m
|
|
}
|
|
}
|
|
// 未找到 target ，返回插入点 i
|
|
return i;
|
|
}
|
|
|
|
/* 二分查找插入点（存在重复元素） */
|
|
int binarySearchInsertion(int *nums, int numSize, int target) {
|
|
int i = 0, j = numSize - 1; // 初始化双闭区间 [0, n-1]
|
|
while (i <= j) {
|
|
int m = i + (j - i) / 2; // 计算中点索引 m
|
|
if (nums[m] < target) {
|
|
i = m + 1; // target 在区间 [m+1, j] 中
|
|
} else if (nums[m] > target) {
|
|
j = m - 1; // target 在区间 [i, m-1] 中
|
|
} else {
|
|
j = m - 1; // 首个小于 target 的元素在区间 [i, m-1] 中
|
|
}
|
|
}
|
|
// 返回插入点 i
|
|
return i;
|
|
}
|
|
|
|
/* Driver Code */
|
|
int main() {
|
|
// 无重复元素的数组
|
|
int nums1[] = {1, 3, 6, 8, 12, 15, 23, 26, 31, 35};
|
|
printf("\n数组 nums = ");
|
|
printArray(nums1, sizeof(nums1) / sizeof(nums1[0]));
|
|
// 二分查找插入点
|
|
int targets1[] = {6, 9};
|
|
for (int i = 0; i < sizeof(targets1) / sizeof(targets1[0]); i++) {
|
|
int index = binarySearchInsertionSimple(nums1, sizeof(nums1) / sizeof(nums1[0]), targets1[i]);
|
|
printf("元素 %d 的插入点的索引为 %d\n", targets1[i], index);
|
|
}
|
|
|
|
// 包含重复元素的数组
|
|
int nums2[] = {1, 3, 6, 6, 6, 6, 6, 10, 12, 15};
|
|
printf("\n数组 nums = ");
|
|
printArray(nums2, sizeof(nums2) / sizeof(nums2[0]));
|
|
// 二分查找插入点
|
|
int targets2[] = {2, 6, 20};
|
|
for (int i = 0; i < sizeof(targets2) / sizeof(int); i++) {
|
|
int index = binarySearchInsertion(nums2, sizeof(nums2) / sizeof(nums2[0]), targets2[i]);
|
|
printf("元素 %d 的插入点的索引为 %d\n", targets2[i], index);
|
|
}
|
|
|
|
return 0;
|
|
}
|