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

977.有序数组的平方

代码随想录代码随想录PDF，代码随想录网站，代码随想录百度网盘，代码随想录知识星球，代码随想录八股文PDF，代码随想录刷题路线，代码随想录知识星球八股文https://programmercarl.com/0977.%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E5%B9%B3%E6%96%B9.html#%E7%AE%97%E6%B3%95%E5%85%AC%E5%BC%80%E8%AF%BE

#偷懒直接使用了Python的built-in function

class Solution:
    def sortedSquares(self, nums: List[int]) -> List[int]:
        nums_new = []
        for i in range(len(nums)):
            nums_new.append(nums[i]**2)
        nums_new.sort()
        return nums_new
        

209.长度最小的子数组

代码随想录代码随想录PDF，代码随想录网站，代码随想录百度网盘，代码随想录知识星球，代码随想录八股文PDF，代码随想录刷题路线，代码随想录知识星球八股文https://programmercarl.com/0209.%E9%95%BF%E5%BA%A6%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.html#%E7%AE%97%E6%B3%95%E5%85%AC%E5%BC%80%E8%AF%BE

#用left和right跟踪sums是否超过target

class Solution:
    def minSubArrayLen(self, target: int, nums: List[int]) -> int:
        left, sums = 0, 0
        min_len = float("inf")
        n = len(nums)

        for right in range(n):
            sums += nums[right]
            while sums >= target:
                min_len = min(min_len, right - left + 1)
                sums -= nums[left]
                left += 1
                
        return min_len if min_len != float("inf") else 0

59.螺旋矩阵II

代码随想录代码随想录PDF，代码随想录网站，代码随想录百度网盘，代码随想录知识星球，代码随想录八股文PDF，代码随想录刷题路线，代码随想录知识星球八股文https://programmercarl.com/0059.%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5II.html#%E7%AE%97%E6%B3%95%E5%85%AC%E5%BC%80%E8%AF%BE

#四个顶点均设置指针

class Solution:
    def generateMatrix(self, n: int) -> List[List[int]]:
        mat = [[0] * n for _ in range(n)]
        left, right = 0, n - 1
        top, bottom  = 0, n - 1
        val = 1

        while left <= right:
            for c in range(left, right + 1):
                mat[top][c] = val
                val += 1
            top += 1
            for r in range(top, bottom + 1):
                mat[r][right] = val
                val += 1
            right -= 1
            for c in range(right, left - 1, -1):
                mat[bottom][c] = val
                val += 1
            bottom -= 1
            for r in range(bottom, top - 1, -1):
                mat[r][left] = val
                val += 1
            left += 1
        
        return mat