[Leetcode] 1525. 字符串的好分割数目
作者:
Alier
,
2022-10-31 23:48:20
,
所有人可见
,
阅读 234
1525. 字符串的好分割数目
class Solution {
public:
int numSplits(string s) {
vector<int> cnt;
int curr=0;
vector<bool> letter(27,0);
for(int i=0; i<s.size(); i++){
if(letter[int(s[i]-'a')] == 0){
letter[int(s[i]-'a')] = 1;
curr++;
}
cnt.push_back(curr);
}//run directly
vector<int> cnt1;
curr=0;
vector<bool> letter1(27,0);
for(int i=s.size()-1; i>=0; i--){
if(letter1[int(s[i]-'a')] == 0){
letter1[int(s[i]-'a')] = 1;
curr++;
}
cnt1.push_back(curr);
}//run reverse
int res=0;
for(int i=0; i<s.size()-1; i++){
if( cnt[i] == cnt1[s.size()-i-2]) res++;
}
return res;
}
};