-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day 16
39 lines (37 loc) · 1.31 KB
/
Day 16
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
class Solution {
public int[] findBall(int[][] grid) {
int[] answer = new int[grid[0].length];
int a=grid.length; //current position of the ball
int k=0;
int c=0;
for(int i=0;i<grid[0].length;i++){
for(int j=0;j<grid.length;j++){
if((c==0 && grid[j][c]==-1) || (c==grid[0].length-1 && grid[j][c]==1)){
answer[i]=-1;
break;
}
else if((c<grid[0].length-1 && grid[j][c]==1 && grid[j][c+1]==-1) || (c>0 && grid[j][c]==-1 && grid[j][c-1]==1)){
answer[i]=-1;
break;
}
else if(grid[j][c]==1){
if(c<grid[0].length-1){
c=c+1;
}
if(j==grid.length-1)
answer[i]=c;
}
else if(grid[j][c]==-1){
if(c>0){
c=c-1;
}
if(j==grid.length-1)
answer[i]=c;
}
}
k++;
c=k;
}
return answer;
}
}