代码随想录算法训练营第一天 | 数组和二分查找

704. 二分查找

二分查找模板：左闭右开区间搜索(search1) 和 闭区间搜索(search 2)

左闭右开区间搜索：起始的最右端需为 index=nums.length

public int search1(int[] nums, int target) {
    int lo = 0, hi = nums.length;
    while(lo < hi){
        int mid = lo + (hi - lo) / 2;
        if (nums[mid] == target) return mid;
        if (nums[mid] < target) lo = mid + 1;
        else hi = mid;
    }
    return -1;
}

public int search2(int[] nums, int target) {
    int lo = 0, hi = nums.length - 1;
    while(lo <= hi){
        int mid = lo + (hi - lo) / 2;
        if (nums[mid] == target) return mid;
        else if (nums[mid] < target) lo = mid + 1;
        else hi = mid - 1;
    }
    return -1;
}

35.搜索插入位置

搜索完毕后未找到target，在此情况下right = left - 1, 且指针left指向应插入位置

public int searchInsert(int[] nums, int target) {
    int lo = 0, hi = nums.length - 1;
    while(lo <= hi){
        int mid = lo + (hi - lo) / 2;
        if (nums[mid] == target) return mid;
        if (nums[mid] < target) lo = mid + 1;
        else hi = mid - 1; 
    }
    return lo;
}

34. 在排序数组中查找元素的第一个和最后一个位置

注意事项

1. edge case: nums == null || nums.length == 0
2. 在第一轮二分查找终止后如果没找到target，可提前结束整个程序，不需进入第二轮二分法
3. mid需提前定义，才能在二分查找结束后再次引用

public int[] searchRange(int[] nums, int target) {
    if (nums.length == 0) return new int[]{-1, -1};
    int[] res = new int[2];
    // find the first occurence
    int lo = 0, hi = nums.length - 1;
    int mid = 0;
    while(lo <= hi){
        mid = lo + (hi - lo) / 2;
        if (nums[mid] == target){
            if (mid == 0 || (mid != 0) && (nums[mid - 1] < target)){
                break;
            }
            else hi = mid - 1;
        }
        else if (nums[mid] < target) lo = mid + 1;
        else hi = mid - 1;
    }
    if (nums[mid] != target) return new int[]{-1, -1};
    res[0] = mid;
    // find the second occurence
    lo = 0;
    hi = nums.length - 1;
    while(lo <= hi){
        mid = lo + (hi - lo) / 2;
        if (nums[mid] == target){
            if (mid == nums.length - 1 || (mid != nums.length - 1) && (nums[mid + 1] > target)){
                break;
            }
            else lo = mid + 1;
        }
        else if (nums[mid] < target) lo = mid + 1;
        else hi = mid - 1;
    }
    res[1] = mid;
    return res;
}

27. 移除元素

使用curr指针追踪可用来替换的位置。curr指针增加当且仅当本轮搜索未发现val且进行替换

public int removeElement(int[] nums, int val) {
    if (nums == null || nums.length == 0) return 0;
    int curr = 0;
    for (int i = 0; i < nums.length; i++){
        if (nums[i] != val){
            nums[curr++] = nums[i];
        }
    }
    return curr;
}