2021.1.28每日复习 130.被围绕的区域（DFS+BFS）+ 131.分割回文串（回溯）

最新推荐文章于 2022-06-25 23:22:35 发布

weixin_44460781

最新推荐文章于 2022-06-25 23:22:35 发布

阅读量69

点赞数

分类专栏：每日练习文章标签： dfs

本文链接：https://blog.csdn.net/weixin_44460781/article/details/113344173

版权

每日练习专栏收录该内容

85 篇文章 0 订阅

订阅专栏

130.被围绕的区域（DFS+BFS）

在这里插入图片描述

class Solution {
    int m = 0;
    int n = 0;
    public void solve(char[][] board) {
		m = board.length;
		if(m == 0) return;
		n = board[0].length;
		for(int i = 0; i < n; i++) {
			if(board[0][i] == 'O') dfs(board, 0, i);
			if(board[m - 1][i] == 'O') dfs(board, m - 1, i);
		}
		for(int i = 1; i < m - 1; i++) {
			if(board[i][0] == 'O') dfs(board, i, 0);
			if(board[i][n - 1] == 'O') dfs(board, i, n - 1);
		}
		for(int i = 0; i < m; i++) {
			for(int j = 0; j < n; j++) {
				if(board[i][j] == 'X') continue;
				else if(board[i][j] == 'O') board[i][j] = 'X';
				else board[i][j] = 'O';
			}
		}
    }
    public void dfs(char[][] board, int x, int y) {
    	  if(x >= m || x < 0 || y >= n || y < 0 || board[x][y] != 'O') return;
    	  board[x][y] = 'M';
    	  dfs(board, x - 1, y);
    	  dfs(board, x, y + 1);
    	  dfs(board, x + 1, y);
    	  dfs(board, x, y - 1);
    }
}

131.分割回文串（回溯）

在这里插入图片描述

class Solution {
    public List<List<String>> partition(String s) {
        List<List<String>> res = new ArrayList<>();
        if(s.length() < 1) return res;
        Deque<String> path = new ArrayDeque<>();
        dfs(s, 0, path, res);
        return res;
    }
    public void dfs(String s, int start, Deque<String> path, List<List<String>> res) {
        if(start == s.length()) {
            res.add(new ArrayList<>(path));
            return;
        }
        for(int i = start; i < s.length(); i++) {
            if(!check(s, start, i)) continue;
            path.addLast(s.substring(start, i + 1));
            dfs(s, i + 1, path, res);
            path.removeLast();
        }
    }
    public boolean check(String s, int start, int end) {
        while(start <= end) {
            if(s.charAt(start) != s.charAt(end)) return false;
            start++;
            end--;
        }
        return true;
    }
}