代码随想录算法训练营Day1|LeetCode

最新推荐文章于 2024-09-15 08:16:50 发布

cass111111

最新推荐文章于 2024-09-15 08:16:50 发布

阅读量247

点赞数

文章标签：算法 leetcode Powered by 金山文档

本文链接：https://blog.csdn.net/weixin_43269816/article/details/128651268

版权

文章展示了两种算法在数组处理中的使用：一是二分查找法（BinarySearch），用于在有序数组中定位目标值；二是删除元素的方法（RemoveElement），通过快慢双指针或相向双指针来移除特定值的元素。这两种方法都是高效解决数组问题的典型策略。

摘要由CSDN通过智能技术生成

Q704 Binary Search

[Q704]

def binarysearch(nums: list[int], target: int)->int:
    # [left, right]
    left, right = 0, len(nums)-1
    while left <= right:
        mid = left + (right-left)//2
        if nums[mid]>target:
            right = mid - 1
        elif nums[mid]<target:
            left = mid + 1
        else:
            return mid
     return -1

var search = function(nums, target) {
    let left = 0;
    let right = nums.length-1;
    while (left<=right){
        mid = left+((right-left)>>1)
        if (nums[mid]>target){
            right = mid - 1
        }
        else if (nums[mid]<target) {
            left = mid + 1
        }
        else{
            return mid;
        }
    }
    return -1 
};

Q27 Remove Element

[Q27]

def removeElement(self, nums: List[int], val: int) -> int:
    fast = 0 # as index looping nums
    slow = 0 # make sure at the end [0, slow) it the border of non-val 
    for fast in range(len(nums)):
        if nums[fast] != val:
            nums[slow] = nums[fast]
            slow += 1
    return slow

// Way1 快慢双指针
var removeElement = function(nums, val) {
    let slow = 0;
    for (let fast=0;fast<nums.length;fast++) {
        if (nums[fast]!== val){
            nums[slow] = nums[fast]
            slow ++
        }
    }
    return slow;
};
// Way2: 相向双指针
var removeElement = function(nums, val) {
    let left = 0;
    let right = nums.length-1;
    //将right移到从右数第一个值不为val的位置
    while (right>=0 && nums[right]==val) right--;
    while (left<=right){
        if (nums[left] == val){
            //将right位置的元素移到left（覆盖），right位置移除
            nums[left] = nums[right];
            right --;
        }
        left ++;
        while(right >= 0 && nums[right] == val) right--;
    }
    return left;
};

Reference from: https://programmercarl.com/