leetcode

0 class Solution {

1 int m, n;

2

3 bool valid_column(int column) { return column >= 0 && column < n; }

4

5 int simulate(int column, vector<vector<int>> &grid) {

6 int row = 0;

7 while (row < m) {

8 int type = grid[row][column];

9 int nextc = column + type;

10 if (valid_column(nextc) && grid[row][nextc] == type) {

11 row++;

12 column = nextc;

13 } else

14 return -1;

15 }

16 return column;

17 }

18

19 public:

20 vector<int> findBall(vector<vector<int>> &grid) {

21 m = grid.size();

22 n = grid[0].size();

23

24 vector<int> res;

25 for (int i = 0; i < n; i++)

26 res.push_back(simulate(i, grid));

27 return res;

28 }

29 };