leetcode-数组-二分查找【寻找左、右侧边界】-滑动窗口【最长子字符串、字符串的排列】

catgray

已于 2022-10-27 15:45:59 修改

阅读量178

点赞数

分类专栏：刷题文章标签： leetcode 算法数据结构

于 2022-10-21 15:29:42 首次发布

本文链接：https://blog.csdn.net/catgray/article/details/127447149

版权

刷题专栏收录该内容

7 篇文章 0 订阅

订阅专栏

2022年10月21日 15点16分

二分查找

简单

二分查找

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        left,right = 0,len(nums)-1
        while left<=right:
            mid = left + (right-left)//2
            if nums[mid]==target:
                return mid
            elif nums[mid]<target:
                left = mid+1
            elif nums[mid]>target:
                right = mid-1
        return -1

寻找左右侧边界

int binary_search(int[] nums, int target) {
    int left = 0, right = nums.length - 1; 
    while(left <= right) {
        int mid = left + (right - left) / 2;
        if (nums[mid] < target) {
            left = mid + 1;
        } else if (nums[mid] > target) {
            right = mid - 1; 
        } else if(nums[mid] == target) {
            // 直接返回
            return mid;
        }
    }
    // 直接返回
    return -1;
}

int left_bound(int[] nums, int target) {
    int left = 0, right = nums.length - 1;
    while (left <= right) {
        int mid = left + (right - left) / 2;
        if (nums[mid] < target) {
            left = mid + 1;
        } else if (nums[mid] > target) {
            right = mid - 1;
        } else if (nums[mid] == target) {
            // 别返回，锁定左侧边界
            right = mid - 1;
        }
    }
    // 判断 target 是否存在于 nums 中
    // 此时 target 比所有数都大，返回 -1
    if (left == nums.length) return -1;
    // 判断一下 nums[left] 是不是 target
    return nums[left] == target ? left : -1;
}

int right_bound(int[] nums, int target) {
    int left = 0, right = nums.length - 1;
    while (left <= right) {
        int mid = left + (right - left) / 2;
        if (nums[mid] < target) {
            left = mid + 1;
        } else if (nums[mid] > target) {
            right = mid - 1;
        } else if (nums[mid] == target) {
            // 别返回，锁定右侧边界
            left = mid + 1;
        }
    }
    // 此时 left - 1 索引越界
    if (left - 1 < 0) return -1;
    // 判断一下 nums[left] 是不是 target
    return nums[left - 1] == target ? (left - 1) : -1;
}

滑动窗口

题目列表

3. 无重复字符的最长子串

维护一个window存储字符数量

# 3. 无重复字符的最长子串
class Solution:
    def lengthOfLongestSubstring(self, s: str) -> int:
        window = dict()
        left,right,res = 0,0,0
        while right<len(s):
            c = s[right]
            right += 1
            if c in window.keys():
                window[c] += 1
            else:
                window[c] = 1
            while window[c]>1:
                d = s[left]
                left += 1
                window[d] -= 1
            res = max(res,right-left)
        
        return res