[LeetCode] 214. Shortest Palindrome 最短回文串

1. #include
   #include
   using namespace std;
   string ShortestPalindrome(string str)
   {
   string t = str;
   reverse(t.begin(), t.end());
   int n = t.size(),i=0;
   for (i = n; i >= 0; i–)
   {
   if (str.substr(0, i) == t.substr(n-i))
   {
   break;
   }
   }
   return t.substr(0,n-i)+str;
   }
   int main()
   {
   cout << ShortestPalindrome(“1233”) << endl;
   system(“pause”);
   return 0;
   }