Shortest Palindrome_Week6

Shortest Palindrome_Week6

题目：(Shortest Palindrome) ←链接戳这里

题目说明：
Given a string S, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can find by performing this transformation.

For example:

Given “aacecaaa”, return “aaacecaaa”.

Given “abcd”, return “dcbabcd”.

难度: Hard

解题思路：
题目意为，给定一个字符串s，返回其最短的Palindrome，即对称字符串(最中间的字符串为轴)。
例:
“abcd” 返回 “dcbabcd”
“aacecaaa” 返回 “aaacecaaa”
则我解题的思路为将s翻转为reverseS，令i = 0，遍历reverseS的每一个字符，从i字符开始往后的子字符串，若子字符串已对称，则在reverseS最后加上从0到i的子字符串的翻转，得到已对称的reverseS，最后再翻转，返回；
例子：
“abcd” 则翻转字符串“dcba”遍历到 b，加上”dcb”字符串的翻转，得到”dcbabcd”

#include <iostream>
#include <string> 
#include <algorithm>
using namespace std;

class Solution {
public:
    string shortestPalindrome(string s) {
        //s = "abcd"
        string reverseS = s;
        int length = s.size();
        //reverseS = "dcba"
        reverse(reverseS.begin(),reverseS.end());
        for (int i = 1; i < length; i++) {
        //若此时reverseS已对称则返回其翻转后字符串，否则重置字符串
            if (testIfPalindrom(reverseS)) {
                reverse(reverseS.begin(),reverseS.end());
                return reverseS;
            } else {
                reverseS = s;
                reverse(reverseS.begin(),reverseS.end());
            }
            //测字符串是否对称，若对称，则将前面不对称的补齐后返回
            if (testIfPalindrom(reverseS.substr(i,length-i))) {
                string temp = reverseS.substr(0,i);
                reverse(temp.begin(),temp.end());
                reverseS += temp;
            }
        }
        reverse(reverseS.begin(),reverseS.end());
        return reverseS;
    }

    //用于判断字符串是否符合Palindrom对称的辅助函数
    bool testIfPalindrom(string s) {
        int i = 0, length = s.size();
        int j = length - 1;
        for (i = 0; i < (length/2); i++) {
            if (s[i] != s[j]) {
                return false;
            }
            j--;
        }
        return true; 
    }
};