Day 02

碰碰狗

已于 2024-08-30 23:46:24 修改

阅读量110

点赞数 1

分类专栏：代码随想录算法训练营45期文章标签： leetcode 数据结构算法

于 2024-08-29 23:43:48 首次发布

本文链接：https://blog.csdn.net/suitaox26456/article/details/141690481

版权

代码随想录算法训练营45期专栏收录该内容

5 篇文章 0 订阅

订阅专栏

209. 长度最小的子数组

滑动窗口

class Solution
{
public:
    int minSubArrayLen(int target, vector<int>& nums)
    {
        int left{}, right{}, minLen{ INT_MAX }, sum{};

        for (; right < nums.size(); right++)
        {
            sum += nums[right];
            if (sum >= target)
            {
                minLen = min(minLen, right - left + 1);

                while (left <= right && sum >= target)
                {
                    //minLen = min(minLen, right - left + 1);
                    sum -= nums[left];
                    left++;
                }
            }
        }

        return (minLen == INT_MAX) ? 0 : minLen;
    }
};

59. 螺旋矩阵 II

模拟

class Solution
{
public:
    vector<vector<int>> generateMatrix(int n)
    {
        vector<vector<int>> matrix(n, vector<int>(n));
        int left{ 0 }, right{ n - 1 }, up{ 0 }, down{ n - 1 }, val{ 1 };

        while (val < n * n)
        {
            for (int i = left; i < right; i++)
            {
                matrix[up][i] = val;
                val++;
            }
            for (int i = up; i < down; i++)
            {
                matrix[i][right] = val;
                val++;
            }
            for (int i = right; i > left; i--)
            {
                matrix[down][i] = val;
                val++;
            }
            for (int i = down; i > up; i--)
            {
                matrix[i][left] = val;
                val++;
            }

            left++;
            right--;
            up++;
            down--;
        }

        if (n % 2 == 1)
        {
            matrix[n / 2][n / 2] = n * n;
        }

        return matrix;
    }
};