Runtime: 13 ms (Top 59.97%) | Memory: 53.7 MB (Top 81.02%)

Author: AnasImloul

scripts/algorithms/S/Shortest Bridge/Shortest Bridge.java

@@ -1,3 +1,5 @@
+// Runtime: 13 ms (Top 59.97%) | Memory: 53.7 MB (Top 81.02%)
+
 class Solution {
     private static int[][] dirs={{1,0},{-1,0},{0,1},{0,-1}};
     public int shortestBridge(int[][] grid) {
@@ -19,10 +21,10 @@ public int shortestBridge(int[][] grid) {
                 Pair pair=queue.poll();
                 for(int k=0;k<4;k++){
                     int rowDash=pair.row+dirs[k][0];
-                    int colDash=pair.col+dirs[k][1];                    
-                    if(rowDash<0 || colDash<0 || rowDash>=grid.length || colDash>=grid[0].length || 
+                    int colDash=pair.col+dirs[k][1];
+                    if(rowDash<0 || colDash<0 || rowDash>=grid.length || colDash>=grid[0].length ||
                        visited[rowDash][colDash]==true )continue;
-                    if(grid[rowDash][colDash]==1) return level;                    
+                    if(grid[rowDash][colDash]==1) return level;
                     queue.add(new Pair(rowDash,colDash));
                     visited[rowDash][colDash]=true;
                 }
@@ -37,7 +39,7 @@ private void dfs(int[][] grid,int i,int j,LinkedList<Pair> queue,boolean[][] vis
         for(int k=0;k<4;k++){
             int rowDash=i+dirs[k][0];
             int colDash=j+dirs[k][1];
-        if(rowDash<0 || colDash<0 || rowDash>=grid.length || colDash>=grid[0].length || 
+        if(rowDash<0 || colDash<0 || rowDash>=grid.length || colDash>=grid[0].length ||
            visited[rowDash][colDash]==true || grid[rowDash][colDash]==0)continue;
         dfs(grid,rowDash,colDash,queue,visited);
         }
@@ -50,4 +52,4 @@ public Pair(int row,int col){
             this.col=col;
         }
     }
-}
+}