my-leetcode-logs-20230527
59.螺旋矩阵II1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253class Solution { public int[][] generateMatrix(int n) { //定义一个动态增加的list，最后
my-leetcode-logs-20230525
209.长度最小的子数组1234567891011121314151617//滑动窗口class Solution { public int minSubArrayLen(int target, int[] nums) { int result = 1000000001; int start = 0; int sum = 0;