摘要:
数组去重 def removeDuplicates(nums): n = len(nums) if n == 0: return 0 slow,fast = 0,1 while fast < n: if nums[fast] != nums[slow]: slow += 1 nums[slow] = 阅读全文
摘要:
模板 left,right = 0,0 while right < len(s): windows.append(s[right]) right += 1 while (windows needs shrink): window.pop(0) left += 1 leetcode 76 最小覆盖子串 阅读全文