优化算法之BFS解决FloodFill算法1

0.FloodFill简介

dfs：深度优先遍历（红色）

bfs：宽度优先遍历

1.图像渲染

算法原理

1. class Solution {

2. int[] dx = { 0, 0, 1, -1 };

3. int[] dy = { 1, -1, 0, 0 };

5. public int[][] floodFill(int[][] image, int sr, int sc, int color) {

6. int prev = image[sr][sc]; // 统计刚开始的颜⾊

7. if (prev == color)

8. return image; // 处理边界情况

9. int m = image.length, n = image[0].length;

10. Queue<int[]> q = new LinkedList<>();

11. q.add(new int[] { sr, sc });

12. while (!q.isEmpty()) {

13. int[] t = q.poll();

14. int a = t[0], b = t[1];

15. image[a][b] = color;

16. // 上下左右四个⽅向

17. for (int i = 0; i < 4; i++) {

18. int x = a + dx[i], y = b + dy[i];

19. if (x >= 0 && x < m && y >= 0 && y < n && image[x][y] == prev) {

20. q.add(new int[] { x, y });

21. }

22. }

23. }

24. return image;

25. }

26. }

 2.岛屿数量

200. 岛屿数量 - 力扣（LeetCode）

算法原理 

1. class Solution {

2. int[] dx = { 0, 0, -1, 1 };

3. int[] dy = { 1, -1, 0, 0 };

4. boolean[][] vis = new boolean[301][301];

5. int m, n;

7. public int numIslands(char[][] grid) {

8. m = grid.length;

9. n = grid[0].length;

10. int ret = 0;

11. for (int i = 0; i < m; i++) {

12. for (int j = 0; j < n; j++) {

13. if (grid[i][j] == '1' && !vis[i][j]) {

14. ret++;

15. bfs(grid, i, j);

16. }

17. }

18. }

19. return ret;

20. }

22. public void bfs(char[][] grid, int i, int j) {

23. Queue<int[]> q = new LinkedList<>();

24. q.add(new int[] { i, j });

25. vis[i][j] = true;

26. while (!q.isEmpty()) {

27. int[] t = q.poll();

28. int a = t[0], b = t[1];

29. for (int k = 0; k < 4; k++) {

30. int x = a + dx[k], y = b + dy[k];

31. if (x >= 0 && x < m && y >= 0 && y < n && grid[x][y] == '1' &&

32. !vis[x][y]) {

33. q.add(new int[] { x, y });

34. vis[x][y] = true;

35. }

36. }

37. }

38. }

39. }

 3.岛屿的最大面积

695. 岛屿的最大面积 - 力扣（LeetCode）

1. class Solution {

2. int[] dx = { 0, 0, 1, -1 };

3. int[] dy = { 1, -1, 0, 0 };

4. boolean[][] vis = new boolean[51][51];

5. int m, n;

7. public int maxAreaOfIsland(int[][] grid) {

8. m = grid.length;

9. n = grid[0].length;

10. int ret = 0;

11. for (int i = 0; i < m; i++) {

12. for (int j = 0; j < n; j++) {

13. if (grid[i][j] == 1 && !vis[i][j]) {

14. ret = Math.max(ret, bfs(grid, i, j));

15. }

16. }

17. }

18. return ret;

19. }

21. public int bfs(int[][] grid, int i, int j) {

22. int count = 0;

23. Queue<int[]> q = new LinkedList<>();

24. q.add(new int[] { i, j });

25. vis[i][j] = true;

26. count++;

27. while (!q.isEmpty()) {

28. int[] t = q.poll();

29. int a = t[0], b = t[1];

30. for (int k = 0; k < 4; k++) {

31. int x = a + dx[k], y = b + dy[k];

32. if (x >= 0 && x < m && y >= 0 && y < n && grid[x][y] == 1 &&

33. !vis[x][y]) {

34. q.offer(new int[] { x, y });

35. vis[x][y] = true;

36. count++;

37. }

38. }

39. }

40. return count;

41. }

42. }

 4.被围绕的区域

130. 被围绕的区域 - 力扣（LeetCode）

算法原理

1. class Solution {

2. int n, m;

4. public void solve(char[][] board) {

5. n = board.length;

6. if (n == 0) {

7. return;

8. }

9. m = board[0].length;

10. for (int i = 0; i < n; i++) {

11. dfs(board, i, 0);

12. dfs(board, i, m - 1);

13. }

14. for (int i = 1; i < m - 1; i++) {

15. dfs(board, 0, i);

16. dfs(board, n - 1, i);

17. }

18. for (int i = 0; i < n; i++) {

19. for (int j = 0; j < m; j++) {

20. if (board[i][j] == 'A') {

21. board[i][j] = 'O';

22. } else if (board[i][j] == 'O') {

23. board[i][j] = 'X';

24. }

25. }

26. }

27. }

29. public void dfs(char[][] board, int x, int y) {

30. if (x < 0 || x >= n || y < 0 || y >= m || board[x][y] != 'O') {

31. return;

32. }

33. board[x][y] = 'A';

34. dfs(board, x + 1, y);

35. dfs(board, x - 1, y);

36. dfs(board, x, y + 1);

37. dfs(board, x, y - 1);

38. }

39. }