Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- int numSplits(string s) {
- unordered_set<char> m1, m2;
- int n=s.length();
- vector<int> pre(n, 0), post(n, 0);
- for(int i=0; i<n; i++){
- m1.insert(s[i]);
- pre[i] = m1.size();
- }
- for(int i=n-1; i>=0; i--){
- m2.insert(s[i]);
- post[i] = m2.size();
- }
- int ans = 0;
- for(int i=0; i<n-1; i++){
- if(pre[i] == post[i+1])
- ans++;
- }
- return ans;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement