sinat_40469883的博客

class Solution: def findContinuousSequence(self, target: int) -> List[List[int]]: #双指针 i, j, s, res = 1, 2, 3, [] while i < j: if s == target: res.append(list(range(i, j+1))) ...

class Solution: def lengthOfLongestSubstring(self, s: str) -> int: if not s: return 0 n = len(s) #动态规划 dic = {} res, tmp = 0, 0 for j in range(n): i = dic.get(s[j], -1) dic...

class Solution: def exchange(self, nums: List[int]) -> List[int]: left, right = 0, len(nums)-1 while left < right: while left < right and nums[left] % 2 == 1: left += 1 while left <...

思路：1.先排序保证不重复以及减小复杂度 2. 左右双指针，左指针右移，右指针左移 代码实现： class Solution: def threeSum(self, nums: List[int]) -> List[List[int]]: n = len(nums) if n < 3: return [] nums.sort()#先排序，保证不重复并且减少时间复杂度 res = []..