LeetCode 733 - Flood Fill


https://leetcode.com/problems/flood-fill/description/
An image is represented by a 2-D array of integers, each integer representing the pixel value of the image (from 0 to 65535).
Given a coordinate (sr, sc) representing the starting pixel (row and column) of the flood fill, and a pixel value newColor, "flood fill" the image.
To perform a "flood fill", consider the starting pixel, plus any pixels connected 4-directionally to the starting pixel of the same color as the starting pixel, plus any pixels connected 4-directionally to those pixels (also with the same color as the starting pixel), and so on. Replace the color of all of the aforementioned pixels with the newColor.
At the end, return the modified image.
Example 1:
Input: 
image = [[1,1,1],[1,1,0],[1,0,1]]
sr = 1, sc = 1, newColor = 2
Output: [[2,2,2],[2,2,0],[2,0,1]]
Explanation: 
From the center of the image (with position (sr, sc) = (1, 1)), all pixels connected 
by a path of the same color as the starting pixel are colored with the new color.
Note the bottom corner is not colored 2, because it is not 4-directionally connected
to the starting pixel.
Note:


  • The length of image and image[0] will be in the range [1, 50].
  • The given starting pixel will satisfy 0 <= sr < image.length and 0 <= sc < image[0].length.
  • The value of each color in image[i][j] and newColor will be an integer in [0, 65535].

  • https://leetcode.com/problems/flood-fill/discuss/109604/Easy-Python-DFS-(no-need-for-visited)!!!
    The idea is simple. Simply perform a DFS on the source cell. Continue the DFS if:
    1. Next cell is within bounds.
    2. Next cell is the same color as source cell.
    There is a tricky case where the new color is the same as the original color and if the DFS is done on it, there will be an infinite loop. If new color is same as original color, there is nothing to be done and we can simply return the image.

        public int[][] floodFill(int[][] image, int sr, int sc, int newColor) {
            int color = image[sr][sc];
            if (color != newColor) dfs(image, sr, sc, color, newColor);
            return image;
        }
        public void dfs(int[][] image, int r, int c, int color, int newColor) {
            if (image[r][c] == color) {
                image[r][c] = newColor;
                if (r >= 1) dfs(image, r-1, c, color, newColor);
                if (c >= 1) dfs(image, r, c-1, color, newColor);
                if (r+1 < image.length) dfs(image, r+1, c, color, newColor);
                if (c+1 < image[0].length) dfs(image, r, c+1, color, newColor);
            }
        }
    https://leetcode.com/problems/flood-fill/discuss/109613/JavaC++-Clean-Code
        public int[][] floodFill(int[][] image, int sr, int sc, int newColor) {
            if (image[sr][sc] != newColor)
                dfs(image, sr, sc, image[sr][sc], newColor);
            return image;
        }
    
        private void dfs(int[][] image, int i, int j, int c0, int c1) {
            if (i < 0 || j < 0 || i >= image.length || j >= image[0].length || image[i][j] != c0) return;
            image[i][j] = c1;
            dfs(image, i, j - 1, c0, c1);
            dfs(image, i, j + 1, c0, c1);
            dfs(image, i - 1, j, c0, c1);
            dfs(image, i + 1, j, c0, c1);
        }
    X. BFS
    https://leetcode.com/problems/flood-fill/discuss/126058/Java-BFS-no-need-visited-matrix
    We don't need visited matrix here. We can compare the originalValue and newColor. If they are same, just return the original matrix.
    If the originalValue is similar to newColor, we simply return the original matrix. So we don't need the visited matrix.
        public int[][] floodFill(int[][] image, int sr, int sc, int newColor) {
            if (image == null || image.length == 0 || image[0].length == 0) {
                return new int[0][0];
            }
            if (sr < 0 || sr >= image.length) {
                return image;
            }
            if (sc < 0 || sc >= image[0].length) {
                return image;
            }
            Queue<int[]> queue = new LinkedList<>();
            queue.offer(new int[]{sr, sc});
            int originalValue = image[sr][sc];
            if (originalValue == newColor) {
                return image;
            }
            image[sr][sc] = newColor;
            int[][] dirs = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
            while (!queue.isEmpty()) {
                int[] cur = queue.poll();
                for (int[] d : dirs) {
                    int x = cur[0] + d[0];
                    int y = cur[1] + d[1];
                    if (x < 0 || x >= image.length) {
                        continue;
                    }
                    if (y < 0 || y >= image[0].length) {
                        continue;
                    }
                    if (image[x][y] != originalValue) {
                        continue;
                    }
                    image[x][y] = newColor;
                    queue.offer(new int[]{x, y});
                }
            }
            return image;
        }
    }
    If the originalValue is similar to newColor, we simply return the original matrix. So we don't need the visited matrix.
        public int[][] floodFill(int[][] image, int sr, int sc, int newColor) {
            if (image == null || image.length == 0 || image[0].length == 0) {
                return new int[0][0];
            }
            if (sr < 0 || sr >= image.length) {
                return image;
            }
            if (sc < 0 || sc >= image[0].length) {
                return image;
            }
            Queue<int[]> queue = new LinkedList<>();
            queue.offer(new int[]{sr, sc});
            int originalValue = image[sr][sc];
            if (originalValue == newColor) {
                return image;
            }
            image[sr][sc] = newColor;
            int[][] dirs = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
            while (!queue.isEmpty()) {
                int[] cur = queue.poll();
                for (int[] d : dirs) {
                    int x = cur[0] + d[0];
                    int y = cur[1] + d[1];
                    if (x < 0 || x >= image.length) {
                        continue;
                    }
                    if (y < 0 || y >= image[0].length) {
                        continue;
                    }
                    if (image[x][y] != originalValue) {
                        continue;
                    }
                    image[x][y] = newColor;
                    queue.offer(new int[]{x, y});
                }
            }
            return image;
        }
    }
    
    https://leetcode.com/problems/flood-fill/discuss/109596/Java-easy-BFS
            public int[][] floodFill(int[][] image, int sr, int sc, int newColor) {
                int[] directions = new int[]{0, 1, 0, -1, 0};
                int m = image.length;
                int n = image[0].length;
                int originalValue = image[sr][sc];
                image[sr][sc] = newColor;
    
                boolean[][] visited = new boolean[m][n];
    
                Queue<int[]> queue = new LinkedList<>();
                queue.offer(new int[]{sr, sc});
                while (!queue.isEmpty()) {
                    int[] curr = queue.poll();
                    visited[curr[0]][curr[1]] = true;
                    for (int i = 0; i < directions.length - 1; i++) {
                        int nextR = curr[0] + directions[i];
                        int nextC = curr[1] + directions[i + 1];
                        if (nextR < 0 || nextC < 0 || nextR >= m || nextC >= n || image[nextR][nextC] != originalValue || visited[nextR][nextC]) {
                            continue;
                        }
                        image[nextR][nextC] = newColor;
                        queue.offer(new int[]{nextR, nextC});
                    }
                }
                return image;
            }


    multiple ways BFS is faster (level order traversal by qu.size())


        public int[][] floodFill(int[][] image, int sr, int sc, int newColor) {
            //bfs
            if (image[sr][sc] == newColor) return image;
            Queue<int[]> qu = new LinkedList<>();
            qu.offer(new int[]{sr, sc});
            
            int[] gx = {1,-1,0,0};
            int[] gy = {0,0,1,-1};
            
            int oldColor = image[sr][sc];
            
            while (!qu.isEmpty()) {
                int size = qu.size();
                for (int i = 0; i < size; i++) {
                    int[] cur = qu.poll();
                    int x = cur[0];
                    int y = cur[1];
                    image[x][y] = newColor;
                    for (int k = 0; k < 4; k++) {
                        int nx = gx[k] + x;
                        int ny = gy[k] + y;
                        if (nx < 0 || ny < 0 || nx >= image.length || ny >= image[0].length ||
                           image[nx][ny] != oldColor) continue;
                        qu.offer(new int[]{nx, ny});
                    }
                    
                }
            }
            return image;
        }
    

    Labels

    LeetCode (1432) GeeksforGeeks (1122) LeetCode - Review (1067) Review (882) Algorithm (668) to-do (609) Classic Algorithm (270) Google Interview (237) Classic Interview (222) Dynamic Programming (220) DP (186) Bit Algorithms (145) POJ (141) Math (137) Tree (132) LeetCode - Phone (129) EPI (122) Cracking Coding Interview (119) DFS (115) Difficult Algorithm (115) Lintcode (115) Different Solutions (110) Smart Algorithm (104) Binary Search (96) BFS (91) HackerRank (90) Binary Tree (86) Hard (79) Two Pointers (78) Stack (76) Company-Facebook (75) BST (72) Graph Algorithm (72) Time Complexity (69) Greedy Algorithm (68) Interval (63) Company - Google (62) Geometry Algorithm (61) Interview Corner (61) LeetCode - Extended (61) Union-Find (60) Trie (58) Advanced Data Structure (56) List (56) Priority Queue (53) Codility (52) ComProGuide (50) LeetCode Hard (50) Matrix (50) Bisection (48) Segment Tree (48) Sliding Window (48) USACO (46) Space Optimization (45) Company-Airbnb (41) Greedy (41) Mathematical Algorithm (41) Tree - Post-Order (41) ACM-ICPC (40) Algorithm Interview (40) Data Structure Design (40) Graph (40) Backtracking (39) Data Structure (39) Jobdu (39) Random (39) Codeforces (38) Knapsack (38) LeetCode - DP (38) Recursive Algorithm (38) String Algorithm (38) TopCoder (38) Sort (37) Introduction to Algorithms (36) Pre-Sort (36) Beauty of Programming (35) Must Known (34) Binary Search Tree (33) Follow Up (33) prismoskills (33) Palindrome (32) Permutation (31) Array (30) Google Code Jam (30) HDU (30) Array O(N) (29) Logic Thinking (29) Monotonic Stack (29) Puzzles (29) Code - Detail (27) Company-Zenefits (27) Microsoft 100 - July (27) Queue (27) Binary Indexed Trees (26) TreeMap (26) to-do-must (26) 1point3acres (25) GeeksQuiz (25) Merge Sort (25) Reverse Thinking (25) hihocoder (25) Company - LinkedIn (24) Hash (24) High Frequency (24) Summary (24) Divide and Conquer (23) Proof (23) Game Theory (22) Topological Sort (22) Lintcode - Review (21) Tree - Modification (21) Algorithm Game (20) CareerCup (20) Company - Twitter (20) DFS + Review (20) DP - Relation (20) Brain Teaser (19) DP - Tree (19) Left and Right Array (19) O(N) (19) Sweep Line (19) UVA (19) DP - Bit Masking (18) LeetCode - Thinking (18) KMP (17) LeetCode - TODO (17) Probabilities (17) Simulation (17) String Search (17) Codercareer (16) Company-Uber (16) Iterator (16) Number (16) O(1) Space (16) Shortest Path (16) itint5 (16) DFS+Cache (15) Dijkstra (15) Euclidean GCD (15) Heap (15) LeetCode - Hard (15) Majority (15) Number Theory (15) Rolling Hash (15) Tree Traversal (15) Brute Force (14) Bucket Sort (14) DP - Knapsack (14) DP - Probability (14) Difficult (14) Fast Power Algorithm (14) Pattern (14) Prefix Sum (14) TreeSet (14) Algorithm Videos (13) Amazon Interview (13) Basic Algorithm (13) Codechef (13) Combination (13) Computational Geometry (13) DP - Digit (13) LCA (13) LeetCode - DFS (13) Linked List (13) Long Increasing Sequence(LIS) (13) Math-Divisible (13) Reservoir Sampling (13) mitbbs (13) Algorithm - How To (12) Company - Microsoft (12) DP - Interval (12) DP - Multiple Relation (12) DP - Relation Optimization (12) LeetCode - Classic (12) Level Order Traversal (12) Prime (12) Pruning (12) Reconstruct Tree (12) Thinking (12) X Sum (12) AOJ (11) Bit Mask (11) Company-Snapchat (11) DP - Space Optimization (11) Dequeue (11) Graph DFS (11) MinMax (11) Miscs (11) Princeton (11) Quick Sort (11) Stack - Tree (11) 尺取法 (11) 挑战程序设计竞赛 (11) Coin Change (10) DFS+Backtracking (10) Facebook Hacker Cup (10) Fast Slow Pointers (10) HackerRank Easy (10) Interval Tree (10) Limited Range (10) Matrix - Traverse (10) Monotone Queue (10) SPOJ (10) Starting Point (10) States (10) Stock (10) Theory (10) Tutorialhorizon (10) Kadane - Extended (9) Mathblog (9) Max-Min Flow (9) Maze (9) Median (9) O(32N) (9) Quick Select (9) Stack Overflow (9) System Design (9) Tree - Conversion (9) Use XOR (9) Book Notes (8) Company-Amazon (8) DFS+BFS (8) DP - States (8) Expression (8) Longest Common Subsequence(LCS) (8) One Pass (8) Quadtrees (8) Traversal Once (8) Trie - Suffix (8) 穷竭搜索 (8) Algorithm Problem List (7) All Sub (7) Catalan Number (7) Cycle (7) DP - Cases (7) Facebook Interview (7) Fibonacci Numbers (7) Flood fill (7) Game Nim (7) Graph BFS (7) HackerRank Difficult (7) Hackerearth (7) Inversion (7) Kadane’s Algorithm (7) Manacher (7) Morris Traversal (7) Multiple Data Structures (7) Normalized Key (7) O(XN) (7) Radix Sort (7) Recursion (7) Sampling (7) Suffix Array (7) Tech-Queries (7) Tree - Serialization (7) Tree DP (7) Trie - Bit (7) 蓝桥杯 (7) Algorithm - Brain Teaser (6) BFS - Priority Queue (6) BFS - Unusual (6) Classic Data Structure Impl (6) DP - 2D (6) DP - Monotone Queue (6) DP - Unusual (6) DP-Space Optimization (6) Dutch Flag (6) How To (6) Interviewstreet (6) Knapsack - MultiplePack (6) Local MinMax (6) MST (6) Minimum Spanning Tree (6) Number - Reach (6) Parentheses (6) Pre-Sum (6) Probability (6) Programming Pearls (6) Rabin-Karp (6) Reverse (6) Scan from right (6) Schedule (6) Stream (6) Subset Sum (6) TSP (6) Xpost (6) n00tc0d3r (6) reddit (6) AI (5) Abbreviation (5) Anagram (5) Art Of Programming-July (5) Assumption (5) Bellman Ford (5) Big Data (5) Code - Solid (5) Code Kata (5) Codility-lessons (5) Coding (5) Company - WMware (5) Convex Hull (5) Crazyforcode (5) DFS - Multiple (5) DFS+DP (5) DP - Multi-Dimension (5) DP-Multiple Relation (5) Eulerian Cycle (5) Graph - Unusual (5) Graph Cycle (5) Hash Strategy (5) Immutability (5) Java (5) LogN (5) Manhattan Distance (5) Matrix Chain Multiplication (5) N Queens (5) Pre-Sort: Index (5) Quick Partition (5) Quora (5) Randomized Algorithms (5) Resources (5) Robot (5) SPFA(Shortest Path Faster Algorithm) (5) Shuffle (5) Sieve of Eratosthenes (5) Strongly Connected Components (5) Subarray Sum (5) Sudoku (5) Suffix Tree (5) Swap (5) Threaded (5) Tree - Creation (5) Warshall Floyd (5) Word Search (5) jiuzhang (5)

    Popular Posts