代码随想录算法训练营第二天| 977.有序数组的平方 、209.长度最小的子数组、 59.螺旋矩阵II，

LeetCode 977.有序数组的平方

题目链接：有序数组的平方

#冒泡排序
def sortedSquares2(nums):
    for i in range(len(nums)):
        nums[i] =pow(nums[i],2)
    print(nums)
    for i in range (1,len(nums)):
        for j in range (0,len(nums)-i):
            if nums[j] > nums[j+1]:
                nums[j] ,nums[j+1] = nums[j+1],nums[j]
    return nums
# nums = [-5,-3,-2,-1]
# print(sortedSquares(nums))
# 双指针法
def sortedSquares4(nums):
    left = 0
    right = len(nums)-1
    k = len(nums)-1
    result = [0]*len(nums)
    # res = [float('inf')] * len(nums)  # 需要提前定义列表，存放结果
    print(result)
    while left <= right:
        if nums[left]*nums[left] < nums[right]*nums[right]:
            result[k] = nums[right]*nums[right]
            right-=1
            k -= 1
        else :
            result[k] = nums[left]*nums[left]
            left+=1
            k -= 1
    return result
# nums = [-5,-3,-2,-1]
# print(sortedSquares4(nums))
#使用函数
def sortedSquares(nums):
   for i in range(len(nums)):
        nums[i] = nums[i]*nums[i]
   nums.sort()
   return nums
nums = [-5,-3,-2,-1]
print(sortedSquares(nums))

def sortedSquares3(nums):
   return sorted(x*x for x in nums)
nums = [-5,-3,-2,-1]
print(sortedSquares3(nums))

LeetCode 209.长度最小的子数组

题目链接：长度最小的子数组

#暴力求解
def minSubArrayLen(nums,target):
    i=0
    minlen = len(nums)
    while i < len(nums):
        sum = 0
        for j in range  (i,len(nums)):
            sum = sum + nums[j]
            if sum >= target:
                minlen = min(minlen,j-i+1)
                break
        i+=1
    return minlen if minlen != len(nums) else 0
target = 7
nums = [2,3,1,2,4,3]
print(minSubArrayLen(nums,target))
#滑动窗口法

def minSubArrayLen1(nums,target):
    i=0
    left = 0
    right = 0
    minlen = len(nums)
    sum = 0
    while right < len(nums):
        sum = sum + nums[right]
        while sum >= target:
                minlen = min(minlen,right-left+1)
                sum = sum - nums[left]
                left +=1
        right +=1
    return minlen if minlen != len(nums) else 0
target = 7
nums = [2,3,1,2,4,3]
print(minSubArrayLen1(nums,target))
#减少了重复求和的时间

LeetCode 59.螺旋矩阵II

题目链接：螺旋矩阵II

def generateMatrix(n):
    startx,starty = 0 ,0
    count = 1
    nums = [[0] * n for _ in range(n)]
    loop = n//2
    mid = n//2
    for offset in range(1,loop+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 == 1:
            nums[mid][mid]=count

    return nums
n = 3
print(generateMatrix(n))