update 994

fishercoder1534 · fishercoder1534 · commit 45db5b383cb0 · 2024-06-13T07:54:50.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_994.java b/src/main/java/com/fishercoder/solutions/_994.java
@@ -67,13 +67,11 @@ public int orangesRotting(int[][] grid) {
                     }
                 }
             }
-            int min = 0;
+            int time = 0;
             int[] directions = new int[]{0, 1, 0, -1, 0};
             while (!queue.isEmpty() && !fresh.isEmpty()) {
                 int size = queue.size();
-                if (size > 0) {
-                    min++;
-                }
+                time++;
                 for (int i = 0; i < size; i++) {
                     int[] curr = queue.poll();
                     for (int k = 0; k < directions.length - 1; k++) {
@@ -82,15 +80,15 @@ public int orangesRotting(int[][] grid) {
                         if (nextX >= 0 && nextX < m && nextY >= 0 && nextY < n && grid[nextX][nextY] == 1) {
                             fresh.remove(nextX * n + nextY);
                             if (fresh.isEmpty()) {
-                                return min;
+                                return time;
                             }
                             grid[nextX][nextY] = 2;
                             queue.offer(new int[]{nextX, nextY});
                         }
                     }
                 }
             }
-            return fresh.isEmpty() ? min : -1;
+            return fresh.isEmpty() ? time : -1;
         }
     }
 

Original file line number	Diff line number	Diff line change
`@@ -67,13 +67,11 @@ public int orangesRotting(int[][] grid) {`
`67`	`67`	`}`
`68`	`68`	`}`
`69`	`69`	`}`
`70`		`- int min = 0;`
	`70`	`+ int time = 0;`
`71`	`71`	`int[] directions = new int[]{0, 1, 0, -1, 0};`
`72`	`72`	`while (!queue.isEmpty() && !fresh.isEmpty()) {`
`73`	`73`	`int size = queue.size();`
`74`		`- if (size > 0) {`
`75`		`- min++;`
`76`		`- }`
	`74`	`+ time++;`
`77`	`75`	`for (int i = 0; i < size; i++) {`
`78`	`76`	`int[] curr = queue.poll();`
`79`	`77`	`for (int k = 0; k < directions.length - 1; k++) {`
`@@ -82,15 +80,15 @@ public int orangesRotting(int[][] grid) {`
`82`	`80`	`if (nextX >= 0 && nextX < m && nextY >= 0 && nextY < n && grid[nextX][nextY] == 1) {`
`83`	`81`	`fresh.remove(nextX * n + nextY);`
`84`	`82`	`if (fresh.isEmpty()) {`
`85`		`- return min;`
	`83`	`+ return time;`
`86`	`84`	`}`
`87`	`85`	`grid[nextX][nextY] = 2;`
`88`	`86`	`queue.offer(new int[]{nextX, nextY});`
`89`	`87`	`}`
`90`	`88`	`}`
`91`	`89`	`}`
`92`	`90`	`}`
`93`		`- return fresh.isEmpty() ? min : -1;`
	`91`	`+ return fresh.isEmpty() ? time : -1;`
`94`	`92`	`}`
`95`	`93`	`}`
`96`	`94`