Runtime: 1 ms (Top 93.85%) | Memory: 54.4 MB (Top 47.92%)

Author: AnasImloul

scripts/algorithms/W/Where Will the Ball Fall/Where Will the Ball Fall.java

@@ -1,26 +1,27 @@
+// Runtime: 1 ms (Top 93.85%) | Memory: 54.4 MB (Top 47.92%)
 class Solution {
     public int dfs(int[][] grid, int i, int j){
         if(i==grid.length)
             return j;
-        
+
         if(j<0 || j>=grid[0].length)
             return -1;
-        
+
         if(grid[i][j]==1 && j+1<grid[0].length && grid[i][j+1]==1)
             return dfs(grid,i+1,j+1);
-        
+
         else if(grid[i][j]==-1 && j-1>=0 && grid[i][j-1]==-1)
             return dfs(grid,i+1,j-1);
-         
+
         return -1;
     }
     public int[] findBall(int[][] grid) {
         int m = grid[0].length;
         int[] ar = new int[m];
-        
+
         for(int j=0;j<m;j++)
             ar[j]=dfs(grid,0,j);
-        
+
         return ar;
     }
-}
+}