1.27代码class Solution:def removeElement(self, nums: List[int], val: int) - int:slow 0for fast in range(len(nums)):# fast找到不等于val的元素就赋值给slow位置if nums[fast] ! val:nums[slow] nums[fast]slow 1return slow题解2.209代码from typing import Listclass Solution:def minSubArrayLen(self, target: int, nums: List[int]) - int:left 0cur_sum 0min_len float(“inf”) # 记录最小长度初始无穷大for right in range(len(nums)):cur_sum nums[right]# 当前窗口总和满足条件不断收缩左边界找更小窗口while cur_sum target:window_len right - left 1if window_len min_len:min_len window_lencur_sum - nums[left]left 1# 如果min_len没变说明没找到返回0否则返回min_lenreturn 0 if min_len float(“inf”) else min_len题解3.977代码from typing import Listclass Solution:def sortedSquares(self, nums: List[int]) - List[int]:left 0right len(nums) - 1# 结果数组和原数组一样长res [0] * len(nums)# k 指向结果数组的末尾从后往前放最大的数k len(nums) - 1while left right:left_sq nums[left] * nums[left]right_sq nums[right] * nums[right]if left_sq right_sq:res[k] left_sqleft 1else:res[k] right_sqright - 1k - 1return res题解