Update 0695-max-area-of-island.java

Removed unnecessary variables and make it a lot more like the Python solution in the video.

Author: ColstonBod-oy

java/0695-max-area-of-island.java

@@ -1,28 +1,30 @@
 class Solution {
-
-    public int maxAreaOfIsland(int[][] grid) {
-        int ans = 0;
-        int m = grid.length;
-        int n = grid[0].length;
-        for (int i = 0; i < m; i++) {
-            for (int j = 0; j < n; j++) {
-                if (grid[i][j] == 1) ans =
-                    Math.max(dfs(grid, i, j, m, n, new int[] { 0 }), ans);
-            }
-        }
-        return ans;
+  int maxArea = 0;
+  
+  public int maxAreaOfIsland(int[][] grid) {
+    for (int i = 0; i < grid.length; i++) {
+      for (int j = 0; j < grid[0].length; j++) {
+        maxArea = Math.max(maxArea, 
+                    maxAreaOfIsland(grid, i, j));
+      }
     }
 
-    public int dfs(int[][] grid, int i, int j, int m, int n, int[] count) {
-        if (
-            i < 0 || j < 0 || i >= m || j >= n || grid[i][j] == 0
-        ) return count[0];
-        count[0]++;
-        grid[i][j] = 0;
-        dfs(grid, i - 1, j, m, n, count);
-        dfs(grid, i + 1, j, m, n, count);
-        dfs(grid, i, j - 1, m, n, count);
-        dfs(grid, i, j + 1, m, n, count);
-        return count[0];
+    return maxArea;
+  }
+
+  public int maxAreaOfIsland(int[][] grid, int r, int c) {
+    if (r < 0 || c < 0 || 
+        r == grid.length || 
+        c == grid[0].length || 
+        grid[r][c] == 0) {
+          return 0;  
     }
+
+    grid[r][c] = 0;
+    
+    return (1 + maxAreaOfIsland(grid, r + 1, c) +
+                maxAreaOfIsland(grid, r - 1, c) +
+                maxAreaOfIsland(grid, r, c + 1) +
+                maxAreaOfIsland(grid, r, c - 1));
+  }
 }