leetcode(2)：双指针、滑动窗口与螺旋矩阵

1. 双指针
2. 双指针移动窗口
3. 嵌套算法

977.有序数组的平方

class Solution:
    def sortedSquares(self, nums: List[int]) -> List[int]:
        nums_square = [x**2 for x in nums]
				# 设置存放结果的空数组
        result = [None] * len(nums)
        left, right = 0, len(nums) - 1
        res = len(nums) - 1
        while left <= right:
            if nums_square[left] > nums_square[right]:
                result[res] = nums_square[left]
                left += 1
            else:
                result[res] = nums_square[right]
                right -= 1
            res -= 1
        return result

简单的排序问题，但是要注意题目中的有序数列，可以节省下很多时间

209.长度最小的子数组

读题后的想法：

1. 直接暴力解，从每个数的开头进行最短数组的解，一个进行存放

class Solution:
    def minSubArrayLen(self, target: int, nums: List[int]) -> int:
        # 暴力解法
        res = len(nums)
        if sum(nums) < target:
            res = 0
        else:
            for i in range(len(nums)):
                j = i
                while sum(nums[i:j+1]) < target and j < len(nums): j += 1
                res = j-i+1 if sum(nums[i:j+1]) >= target and res > j-i+1 else res
        return res

# 数组过长时超出时间限制

1. 双指针：一个记录开头，有一个记录结尾，每次开头or结尾动1or都动1

class Solution:
    def minSubArrayLen(self, target: int, nums: List[int]) -> int:
        # 双指针
        if sum(nums) < target :
            res = 0
        else:
            left, right = 0, 0
            s = nums[0]
            res = len(nums)
            while right < len(nums):
                if s < target:
                    if right == len(nums) -1 :
                        break
                    s += nums[right+1]
                    right += 1
                else:
                    res = right-left+1 if right-left+1 < res else res
                    s -= nums[left]
                    left += 1
        return res

59. 螺旋矩阵 II

看到题目感觉可以暴力解，但是想了一下应该可以用嵌套算法，来实现；但是奇数和偶数的实现方法不一样；看了一下答案就是暴力求解😿

class Solution:
    def generateMatrix(self, n: int) -> [[int]]:
        l, r, t, b = 0, n - 1, 0, n - 1
        mat = [[0 for _ in range(n)] for _ in range(n)]
        num, tar = 1, n * n
        while num <= tar:
            for i in range(l, r + 1): # left to right
                mat[t][i] = num
                num += 1
            t += 1
            for i in range(t, b + 1): # top to bottom
                mat[i][r] = num
                num += 1
            r -= 1
            for i in range(r, l - 1, -1): # right to left
                mat[b][i] = num
                num += 1
            b -= 1
            for i in range(b, t - 1, -1): # bottom to top
                mat[i][l] = num
                num += 1
            l += 1
        return mat