Get Equal Substrings Within Budget LeetCode solution in C++

1
class Solution {
2
 public:
3
  int equalSubstring(string s, string t, int maxCost) {
4
    int l = 0, r = 0, currCost = 0, n = s.length(), maxLen = 0;
5

6
    while (r < n) {
7
      currCost += abs(s[r] - t[r]);
8
      r++;
9

10
      while (currCost > maxCost) {
11
        currCost -= abs(s[l] - t[l]);
12
        l++;
13
      }
14

15
      maxLen = max(r - l, maxLen);
16
    }
17

18
    return maxLen;
19
  }
20
};