leetcode

0 class Solution {

1 unordered_set<string> seen;

2

3 public:

4 int maxUniqueSplit(const string &s, int idx = 0) {

5 if (idx == size(s)) return size(seen);

6

7 int res = 0;

8 string crnt;

9 for (int i = idx; i < size(s); i++) {

10 auto it = seen.emplace(crnt += s[i]);

11 if (!it.second) continue;

12 res = max(res, maxUniqueSplit(s, i + 1));

13 seen.erase(it.first);

14 }

15

16 return res;

17 }

18 };