mirror of
				https://github.com/krahets/hello-algo.git
				synced 2025-10-31 18:37:48 +08:00 
			
		
		
		
	 56b20eff36
			
		
	
	56b20eff36
	
	
	
		
			
			* .net 8.0 migration * update docs * revert change * revert change and update appendix docs * remove static * Update binary_search_insertion.cs * Update binary_search_insertion.cs * Update binary_search_edge.cs * Update binary_search_insertion.cs * Update binary_search_edge.cs --------- Co-authored-by: Yudong Jin <krahets@163.com>
		
			
				
	
	
		
			65 lines
		
	
	
		
			2.3 KiB
		
	
	
	
		
			C#
		
	
	
	
	
	
			
		
		
	
	
			65 lines
		
	
	
		
			2.3 KiB
		
	
	
	
		
			C#
		
	
	
	
	
	
| /**
 | |
| * File: binary_search_insertion.cs
 | |
| * Created Time: 2023-08-06
 | |
| * Author: hpstory (hpstory1024@163.com)
 | |
| */
 | |
| 
 | |
| namespace hello_algo.chapter_searching;
 | |
| 
 | |
| public class binary_search_insertion {
 | |
|     /* 二分查找插入点(无重复元素) */
 | |
|     public static int BinarySearchInsertionSimple(int[] nums, int target) {
 | |
|         int i = 0, j = nums.Length - 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;
 | |
|     }
 | |
| 
 | |
|     /* 二分查找插入点(存在重复元素) */
 | |
|     public static int BinarySearchInsertion(int[] nums, int target) {
 | |
|         int i = 0, j = nums.Length - 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;
 | |
|     }
 | |
| 
 | |
|     [Test]
 | |
|     public void Test() {
 | |
|         // 无重复元素的数组
 | |
|         int[] nums = [1, 3, 6, 8, 12, 15, 23, 26, 31, 35];
 | |
|         Console.WriteLine("\n数组 nums = " + nums.PrintList());
 | |
|         // 二分查找插入点
 | |
|         foreach (int target in new int[] { 6, 9 }) {
 | |
|             int index = BinarySearchInsertionSimple(nums, target);
 | |
|             Console.WriteLine("元素 " + target + " 的插入点的索引为 " + index);
 | |
|         }
 | |
| 
 | |
|         // 包含重复元素的数组
 | |
|         nums = [1, 3, 6, 6, 6, 6, 6, 10, 12, 15];
 | |
|         Console.WriteLine("\n数组 nums = " + nums.PrintList());
 | |
|         // 二分查找插入点
 | |
|         foreach (int target in new int[] { 2, 6, 20 }) {
 | |
|             int index = BinarySearchInsertion(nums, target);
 | |
|             Console.WriteLine("元素 " + target + " 的插入点的索引为 " + index);
 | |
|         }
 | |
|     }
 | |
| }
 |