480-82（59、151）

liufeng2023

已于 2022-07-29 10:23:38 修改

阅读量103

点赞数

分类专栏：剑指offer 文章标签：算法 leetcode c++

于 2022-07-29 09:21:20 首次发布

本文链接：https://blog.csdn.net/Edward_LF/article/details/126048567

版权

剑指offer 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

59. 螺旋矩阵 II

在这里插入图片描述







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

        vector<vector<int>> res(n, vector<int>(n,0));

        int num = 1, tar = n * n;

        while (num <= tar)
        {
            for (int i = left; i <= right; i++)  res[up][i] = num++;
            up++;
            for (int i = up; i <= down; i++) res[i][right] = num++;
            right--;
            for (int i = right; i >= left; i--)  res[down][i] = num++;
            down--;
            for (int i = down; i >= up; i--) res[i][left] = num++;
            left++;
        }
        return res;
    }
};

在这里插入图片描述

151. 颠倒字符串中的单词

在这里插入图片描述

class Solution {
public:
    string reverseWords(string s) {

        int index = s.size() - 1;
        string res;

        while (index >= 0)
        {
            int count = 0;

            while (index >= 0 && s[index] == ' ')    index--;
            while (index >= 0 &&  s[index] != ' ')
            {
                index--;
                count++;
            }

            if (count)
            {
                res += s.substr(index + 1, count) + " ";
            }
        }
        return res.substr(0, res.size() - 1);
    }
};

在这里插入图片描述

695. 岛屿的最大面积

在这里插入图片描述





class Solution {
private:
    int dfs(vector<vector<int>>& grid, int i, int j)
    {
        if (grid[i][j] == 0) return 0;
        grid[i][j] = 0;

        int res = 1;
        int m = grid.size();
        int n = grid[0].size();

        //向上统计
        if (i - 1 >= 0 && grid[i - 1][j] == 1) res += dfs(grid, i - 1, j);
        //向下统计
        if(i + 1 <= m - 1 && grid[i+1][j] == 1) res += dfs(grid, i + 1, j);
        //向左统计
        if(j - 1 >= 0 && grid[i][j-1] == 1) res += dfs(grid, i, j - 1);
        //向右统计
        if(j + 1 <= n -1 && grid[i][j+1] == 1)  res += dfs(grid, i, j+1);

        return res;
    }
public:
    int maxAreaOfIsland(vector<vector<int>>& grid) {
        int res = 0;

        int m = grid.size();
        int n = grid[0].size();

        for (int i = 0; i < m; i++)
        {
            for (int j = 0; j < n; j++)
            {
                if (grid[i][j] == 1)
                {
                    res = std::max(res, dfs(grid, i, j));
                }
            }
        }
        return res;
    }
};