Execution of All Suffix Instructions Staying in a Grid LeetCode solution in C++

1
class Solution {
2
 public:
3
  vector<int> executeInstructions(int n, vector<int> &start, string s) {
4
    int m = s.size();
5
    vector<int> ans(m);
6
    for (int l = 0; l < m; l++) {
7
      int count = 0;
8
      int i = start[0], j = start[1];
9
      for (int k = l; k < m; k++) {
10
        if (s[k] == 'L') {
11
          if (j - 1 >= 0) {
12
            j--;
13
            count++;
14
          } else
15
            break;
16
        } else if (s[k] == 'R') {
17
          if (j + 1 < n) {
18
            j++;
19
            count++;
20
          } else
21
            break;
22
        } else if (s[k] == 'U') {
23
          if (i - 1 >= 0) {
24
            i--;
25
            count++;
26
          } else
27
            break;
28
        } else {
29
          if (i + 1 < n) {
30
            i++;
31
            count++;
32
          } else
33
            break;
34
        }
35
      }
36
      ans[l] = count;
37
    }
38
    return ans;
39
  }
40
};