Longest Chunked Palindrome Decomposition LeetCode solution in C++

1
class Solution {
2
 public:
3
  int longestDecomposition(string text) {
4
    int ans = 0, i = 0, j = text.size() - 1;
5
    string s = "", t = "";
6

7
    while (i < j) {
8
      s += text[i];
9
      t += text[j];
10
      string rev = t;
11
      reverse(rev.begin(), rev.end());
12

13
      if (s == rev) {
14
        ans++;
15
        t = "";
16
        s = "";
17
      }
18

19
      i++;
20
      j--;
21
    }
22
    ans *= 2;
23

24
    if (i == j || s.size() != 0) ans++;
25
    return ans;
26
  }
27
};