977.有序数组的平方
给你一个按 非递减顺序 排序的整数数组 nums,返回 每个数字的平方 组成的新数组,要求也按 非递减顺序 排序。
class Solution:
def sortedSquares(self, nums: List[int]) -> List[int]:
l,r,i = 0,len(nums) -1, len(nums)-1
res = [float('inf')] * len(nums)
while l <= r:
if nums[l] ** 2 <= nums[r] ** 2:
res[i] = nums[r] ** 2
r -= 1
else:
res[i] = nums[l] ** 2
l +=1
i -= 1
return res
209.长度最小的子数组
给定一个含有 n 个正整数的数组和一个正整数 s ,找出该数组中满足其和 ≥ s 的长度最小的 连续 子数组,并返回其长度。如果不存在符合条件的子数组,返回 0。
class Solution:
def minSubArrayLen(self, target: int, nums: List[int]) -> int:
l = len(nums)
left = 0
right = 0
min_len = float('inf')
cur_sum = 0
while right < l:
cur_sum += nums[right]
while cur_sum >= target:
min_len = min(min_len,right - left + 1)
cur_sum -= nums[left]
left += 1
right += 1
return min_len if min_len != float('inf') else 0
59.螺旋矩阵II
给定一个正整数 n,生成一个包含 1 到 n^2 所有元素,且元素按顺时针顺序螺旋排列的正方形矩阵。
示例:
输入: 3 输出: [ [ 1, 2, 3 ], [ 8, 9, 4 ], [ 7, 6, 5 ] ]
class Solution:
def generateMatrix(self, n: int) -> List[List[int]]:
num = [[0] * n for _ in range(n)]
start_x,start_y = 0,0
loop = mid = n//2
count = 1
for offset in range(1,loop+1):
for j in range(start_y,n-offset):
num[start_x][j] = count
count += 1
for i in range(start_x, n-offset):
num[i][n-offset] = count
count += 1
for j in range(n-offset,start_y,-1):
num[n-offset][j] = count
count += 1
for i in range(n-offset,start_x,-1):
num[i][start_y] = count
count += 1
start_x += 1
start_y += 1
if n % 2 == 1:
num[mid][mid] = count
return num