leetcode

0 class Solution {

1 public:

2 vector<vector<int>> findFarmland(const vector<vector<int>> &land) {

3 const int n = land.size(), m = land[0].size();

4 vector<vector<int>> res;

5 for (int i = 0; i < n; i++) {

6 for (int j = 0; j < m; j++) {

7 if (!land[i][j] || (i > 0 && land[i - 1][j]) || (j > 0 && land[i][j - 1])) continue;

8 int a = i, b = j;

9 while (a < n && land[a][j])

10 a++;

11 while (b < m && land[i][b])

12 b++;

13 res.push_back({i, j, a - 1, b - 1});

14 }

15 }

16 return res;

17 }

18 };