string, C++ (gcc) - rextester

Language: Layout:

#include<iostream>
#include<string>
#include<algorithm>
#include<set>

using namespace std;

bool isPalindrome(const string& s)
{
    int i, j;
    for(i=0, j=s.size()-1; i<j; ++i, --j)
    {
        if(s[i]!=s[j])
            break;
    }   
    
    if(i<j)
        return false;
    else 
        return true;
}

void removeDupSTL(string& s)
{
    for(string::iterator it = s.begin(); it!=s.end(); it++)
    {
        char c = *it;
        s.erase(remove(it+1, s.end(), c), s.end());
    }
}

void removeDup(string& s)
{
    set<char> s;
    for(auto it = s.begin(); it 1= s.end(); it++)
        s.insert(*it);
   
}

int main()
{

string s("ahgfndgcsaaa");
    cout << s << endl << endl;
    
    cout << "Checking if palindrome.." << isPalindrome(s) << endl;
    
    string t = s;
    sort(s.begin(), s.end());
    cout << "After sorting..." << s << endl;
    
    cout << "Removing duplicates from sorted string STL...";
    removeDupSTL(s);
    cout << s << endl;
    
    s = t;
    
    cout << "Remove duplicates from sorted string non-STL...";
    removeDup(s);
    cout << s << endl;

}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 0.93 sec, absolute running time: 0.27 sec, cpu time: 0.2 sec, memory peak: 3 Mb, absolute service time: 1,21 sec