二刷算法基础题DAY1

全排列：（直接用next_permutation解）
模板全排列

class Solution {
public:
    vector<vector<int>> permute(vector<int>& nums) {
        vector<vector<int>> res;
        sort(nums.begin(),nums.end());
        do{
            res.push_back(nums);
        }while(next_permutation(nums.begin(),nums.end()));
        return res;
    }
};

岛屿的数量 (dfs解)
题目链接

class Solution {
public:
    bool v[5000][5000];
    void dfs(int x, int y, vector<vector<char>>& grid){
        if(x+1<grid.size() && grid[x+1][y]=='1'&&!v[x+1][y]) {
            v[x+1][y]=true;
            dfs(x+1,y,grid);
        }
        if(y+1<grid[0].size() && grid[x][y+1]=='1' && !v[x][y+1]){
            v[x][y+1]=true;
            dfs(x,y+1,grid);
        } 
        if(x-1>=0 && grid[x-1][y]=='1'&&!v[x-1][y]) {
            v[x-1][y]=true;
            dfs(x-1,y,grid);
        }
         if(y-1>=0 && grid[x][y-1]=='1'&&!v[x][y-1]) {
            v[x][y-1]=true;
            dfs(x,y-1,grid);
        }
        return ;
    }


    int numIslands(vector<vector<char>>& grid) {        
        int res=0;
        for(int i=0;i<grid.size();i++){
            for(int j=0;j<grid[0].size();j++){
                if(!v[i][j]&& grid[i][j]=='1'){
                    v[i][j]=true;
                    res++;
                    dfs(i,j,grid);
                }
            }
        }
        return res;
    }
};

岛屿的最大面积 （dfs）
题目链接

class Solution {
public:
    bool v[5000][5000];
    int res=0;

    int dfs(int x, int y, const vector<vector<int>>& grid, int curres){

        if(x+1<grid.size() && !v[x+1][y] && grid[x+1][y]==1){
            v[x+1][y]=true;
            curres=dfs(x+1,y,grid,curres+1); 
        }
        if(y+1<grid[0].size() && !v[x][y+1] && grid[x][y+1]==1){
            v[x][y+1]=true;
            curres=dfs(x,y+1,grid,curres+1); 
        }
        if(y-1>=0 && !v[x][y-1] && grid[x][y-1]==1){
            v[x][y-1]=true;
            curres=dfs(x,y-1,grid,curres+1); 
        }
        if(x-1>=0 && !v[x-1][y] && grid[x-1][y]==1){
            v[x-1][y]=true;
            curres=dfs(x-1,y,grid,curres+1); 
        }
        return curres;
    }

    int maxAreaOfIsland(vector<vector<int>>& grid) {
        for(int i=0;i<grid.size();i++){
            for(int j=0;j<grid[0].size();j++){
                if(grid[i][j]==1 && !v[i][j]){
                    int curres=0;
                    v[i][j]=true;
                    curres=dfs(i,j,grid,curres+1);
                    res=max(res,curres);     
                }
            }
        }
        return res;
    }
};

括号匹配
题目链接

class Solution {
public:
    void dfs(int l, int r,string s ,vector<string>& res, int n){
        if(l==n && r==n){
            res.push_back(s);
            return;
        }
        if(l<n){
            s+="(";
             dfs(l+1,r,s,res,n);
             s.resize(s.size()-1);
        }
        if(r<n &&r+1<=l){
            s+=")";
            dfs(l,r+1,s,res,n);
            s.resize(s.size()-1);
        }
    }

    vector<string> generateParenthesis(int n) {
        vector<string> res;
        int l=1,r=0;
        string s="(";
        dfs(l,r,s,res,n);
        return res;
    }
};