学习目标:
双指针2.0
学习内容:
- 有序数组的平方
- 长度最小的子数组
学习产出:
有序数组的平方
class Solution(object):
def sortedSquares(self, nums):
new =[0]*len(nums)
m ,n = 0,len(nums)-1
i=len(nums)-1
while m <=n:
#i从右侧开始计数
#最大的只可能是最左或最右
if nums[m]*nums[m]<nums[n]*nums[n]:
new[i] = nums[n]*nums[n]
n-=1
else:
new[i] = nums[m]*nums[m]
m+=1
i-=1
return new
长度最小的子数组
class Solution(object):
def minSubArrayLen(self, target, nums):
l = len(nums);
left =0
right =0
min_len=100000000
cur_sum =0
while(right<l):
#右侧一直加直到到达target则左侧一直加
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 != 100000000 else 0
#螺旋矩阵
```python
class Solution:
def generateMatrix(self, n: int) -> List[List[int]]:
nums = [[0] * n for _ in range(n)]
startx, starty = 0, 0 # 起始点
loop, mid = n // 2, n // 2 # 迭代次数、n为奇数时,矩阵的中心点
count = 1 # 计数
for offset in range(1, loop + 1) : # 每循环一层偏移量加1,偏移量从1开始
for i in range(starty, n - offset) : # 从左至右,左闭右开
nums[startx][i] = count
count += 1
for i in range(startx, n - offset) : # 从上至下
nums[i][n - offset] = count
count += 1
for i in range(n - offset, starty, -1) : # 从右至左
nums[n - offset][i] = count
count += 1
for i in range(n - offset, startx, -1) : # 从下至上
nums[i][starty] = count
count += 1
startx += 1 # 更新起始点
starty += 1
if n % 2 != 0 : # n为奇数时,填充中心点
nums[mid][mid] = count
return nums