#include <string> #include <cstddef> #include <iostream> #include <cstdlib> #include <cassert> using namespace std; const string& ReverseStrOrder(string& s) { for(size_t i = 0; i < s.size() / 2; i++) { char p; p = s.at(s.size() - i - 1); s.at(s.size() - i - 1) = s.at(i); s.at(i) = p; } return s; } int main(int argc, char* argv[]) { string s(argv[1]); cout << s << endl; cout << ReverseStrOrder(s) << endl; assert(s == ReverseStrOrder(s)); if(s == ReverseStrOrder(s)) cout << "It is a Palindrome." << endl; else cout << "It is not a Palindrome." << endl; } |
#include <string> #include <iostream> #include <algorithm> using namespace std; int main(int argc, char *argv[]) { string s(argv[1]); cout << "original: " << s << endl; reverse(s.begin(), s.end()); cout << "reverse: " << s << endl; return 0; } |
欢迎光临 Chinaunix (http://bbs.chinaunix.net/) | Powered by Discuz! X3.2 |