Using reverse() to create a palindrome tester. : List « Data Structure « C++

Home C++ 1. Bitset 2. Class 3. Console 4. Data Structure 5. Data Type 6. Deque 7. Development 8. File 9. Function 10. Generic 11. Language 12. List 13. Map Multimap 14. Overload 15. Pointer 16. Qt 17. Queue Stack 18. Set Multiset 19. STL Algorithms Binary search 20. STL Algorithms Heap 21. STL Algorithms Helper 22. STL Algorithms Iterator 23. STL Algorithms Merge 24. STL Algorithms Min Max 25. STL Algorithms Modifying sequence operations 26. STL Algorithms Non modifying sequence operations 27. STL Algorithms Sorting 28. STL Basics 29. String 30. Valarray 31. Vector C / ANSI-C C Tutorial C++ Tutorial Visual C++ .NET

C++ » Data Structure » List Screenshots  Using reverse() to create a palindrome tester. #include <iostream> #include <list> using namespace std; char phrases[][80] = {   "Madam, I'm Adam.",   "Able was I ere I saw Elba.",   "A man, a plan, a canal: Panama!",   "This is not one.",   "" }; int main() {   list<char> pal;   int i, j;   list<char>::iterator p;   for(i = 0; *phrases[ i ]; i++) {     for(j = 0; phrases[ i ][ j ]; j++)        pal.push_back(phrases[ i ][ j ]);     cout << "Phrase # " << i << " forward: ";     p = pal.begin();     while(p != pal.end()) cout << *p++;     cout << endl;     // remove extraneous characters     pal.remove(',');     pal.remove('.');     pal.remove('!');     pal.remove(':');     pal.remove('\'');     pal.remove(' ');     cout << "Phrase # " << i << " after deletions: ";     p = pal.begin();     while(p != pal.end())         cout << *p++;     cout << endl;     pal.reverse(); // reverse the list     cout << "Phrase # " << i << " backward:        ";     p = pal.begin();     while(p != pal.end())         cout << *p++;     cout << endl;     pal.clear(); // get ready to try next phrase   }   return 0; }                     Related examples in the same category 1. List basics: push, begin, end pop 2. Elements can be put on the front or end of a list. 3. Define class and store in a list 4. An example of the transform algorithm. 5. Demonstrate merge() in list 6. Merging won't work if the lists aren't ordered. 7. Merge into descending order. 8. A list splicing example. 9. Demonstrate remove() in list 10. Demonstrate unique() in list 11. Using a list to store mailing addresses. 12. Use ostream_iterator for string 13. Demonstrate advance() and distance() in list 14. Using an arrays as a container 15. Using a list: push_back, begin, end, size 16. Merge and splice lists. 17. Copy a list to a vector. 18. Push value in the list 19. Use a binary function object in list 'transform' 20. end() in list. 21. The difference between push_back() and push_front(). 22. Sort a list. 23. Merge two lists. 24. Store class objects in a list. 25. Transform algorithm based on list. 26. Demonstrate bind2nd(). 27. Create a reciprocal function object. 28. Understanding end() in List 29. Difference between push_back() and push_front() 30. Merging One List with Another 31. Storing Class Objects in a List 32. Traverse a List Using an Iterator 33. Demonstrate virtual functons: list interface