DI String Match LeetCode solution in C++

1
class Solution {
2
 public:
3
  vector<int> diStringMatch(string s) {
4
    int p = 0, j = s.size();
5
    vector<int> v;
6
    for (int i = 0; i <= s.size(); i++) {
7
      if (s[i] == 'I')
8
        v.push_back(p++);
9
      else
10
        v.push_back(j--);
11
    }
12
    return v;
13
  }
14
};