First Occurrence - Medium

本文介绍了一种在已排序数组中查找目标整数首次出现位置的算法,采用二分查找法实现,时间复杂度为O(log n),空间复杂度为O(1)。文章提供了详细的代码实现及示例,包括如何处理数组为空或不包含目标值的情况。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Given a target integer T and an integer array A sorted in ascending order, find the index of the first occurrence of T in A or return -1 if there is no such index.

Assumptions

  • There can be duplicate elements in the array.

Examples

  • A = {1, 2, 3}, T = 2, return 1
  • A = {1, 2, 3}, T = 4, return -1
  • A = {1, 2, 2, 2, 3}, T = 2, return 1

Corner Cases

  • What if A is null or A of zero length? We should return -1 in this case.

 

time: O(log(n)), space: O(1)

public class Solution {
  public int firstOccur(int[] array, int target) {
    // Write your solution here
    if(array == null || array.length == 0) return -1;
    int left = 0, right = array.length - 1;
    while(left + 1 < right) {
      int mid = left + (right - left) / 2;
      if(array[mid] == target)
        right = mid;
      else if(array[mid] < target)
        left = mid;
      else
        right = mid;
    }
    if(array[left] == target)
      return left;
    else if(array[right] == target)
      return right;
    else
      return -1;
  }
}

 

转载于:https://www.cnblogs.com/fatttcat/p/10125615.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值