Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- int findTheLongestSubstring(string s) {
- map<char,int> m;
- vector<int> v;
- for(char i:s){
- m[i]++;
- int val=(m['a']%2)*1+(m['e']%2)*2+(m['i']%2)*4+(m['o']%2)*8+(m['u']%2)*16;
- cout<<i<<":"<<val<<' ';
- v.push_back(val);
- }
- // for(int i:v){
- // cout<<i<<' ';
- // }
- cout<<endl;
- for(int i=s.size()-1;i>0;i--){
- for(int j=0;j<s.size()-i+1;j++){
- if((v[j]^v[j+i])==0){
- cout<<s.substr(j+1,i+1)<<endl;
- return i;
- }
- // cout<<s[j]<<' '<<s[j+i]<<endl;
- // cout<<(v[j]^v[j+i])<<' ';
- }
- // cout<<endl;
- }
- return 0;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement