mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-25 13:56:28 +08:00
57 lines
2 KiB
Java
57 lines
2 KiB
Java
|
/**
|
||
|
* File: binary_search_edge.java
|
||
|
* Created Time: 2023-05-21
|
||
|
* Author: Krahets (krahets@163.com)
|
||
|
*/
|
||
|
|
||
|
package chapter_binary_search;
|
||
|
|
||
|
public class binary_search_edge {
|
||
|
/* 二分查找最左一个元素 */
|
||
|
static int binarySearchLeftEdge(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] 中
|
||
|
}
|
||
|
if (i == nums.length || nums[i] != target)
|
||
|
return -1; // 未找到目标元素,返回 -1
|
||
|
return i;
|
||
|
}
|
||
|
|
||
|
/* 二分查找最右一个元素 */
|
||
|
static int binarySearchRightEdge(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
|
||
|
i = m + 1; // 首个大于 target 的元素在区间 [m+1, j] 中
|
||
|
}
|
||
|
if (j < 0 || nums[j] != target)
|
||
|
return -1; // 未找到目标元素,返回 -1
|
||
|
return j;
|
||
|
}
|
||
|
|
||
|
public static void main(String[] args) {
|
||
|
int target = 6;
|
||
|
int[] nums = { 1, 3, 6, 6, 6, 6, 6, 10, 12, 15 };
|
||
|
|
||
|
// 二分查找最左一个元素
|
||
|
int indexLeft = binarySearchLeftEdge(nums, target);
|
||
|
System.out.println("数组中最左一个元素 6 的索引 = " + indexLeft);
|
||
|
|
||
|
// 二分查找最右一个元素
|
||
|
int indexRight = binarySearchRightEdge(nums, target);
|
||
|
System.out.println("数组中最右一个元素 6 的索引 = " + indexRight);
|
||
|
}
|
||
|
}
|