Tests whether a string is a palindrome : string subscript indexer « String « 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++ » String » string subscript indexerScreenshots 
Tests whether a string is a palindrome
  
#include <iostream>
#include <string>
#include <vector>

using namespace std;

bool is_palindrome(string s)
{
   if (s.length() <= 1
     return true;

   char first = s[0];
   char last = s[s.length() 1];

   if (first == last){
      string subString = s.substr(1, s.length() 2);
      return is_palindrome(subString);
   }
   else
      return false;
}

int main()
{
   cout << "Enter a string: ";
   string input;
   getline(cin, input);
   if (!is_palindrome(input)) 
     cout << "false";
   
   return 0;
}
  
    
  
Related examples in the same category
1.Modify char in a string by indexer
2.Accessing characters in a string
3.switch statement based on char value
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.