leetcode 214: Shortest Palindrome

来源：互联网发布：java基础入门培训学校编辑：程序博客网时间：2024/04/30 07:18

Shortest Palindrome

Total Accepted: 172 Total Submissions: 1344

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".

[思路]

从某个char开始向两边扩展(左右两边的字符相等), 如果能一直扩展到字符串的头部, 则将末尾余下的reverse,再加到原字符串的头部,即可.

tips: 1. 中轴字符选从中间开始,这样找到的即为最短的. 2. 中轴字符可能为一个, 也可能为两个.

[CODE]

public class Solution {    public String shortestPalindrome(String s) {    if(s.length()<=1 ) return s;        int center = (s.length()-1)/2;        String res="";        for(int i=center; i>=0; i--) {        if(s.charAt(i) == s.charAt(i+1)) {        if( (res = check1(s, i, i+1)) !=null) return res;        }    if( (res = check1(s, i, i)) !=null) return res;        }        return res;    }    //aabaac    private String check1(String s, int l, int r) {    int i=1;        for(; l-i>=0 && r+i<s.length(); i++) {            if(s.charAt(l-i) != s.charAt(r+i) ) break;        }                if(l-i>=0) return null;         StringBuilder sb = new StringBuilder(s.substring(r+i));        sb.reverse();        return sb+s;    }}

1 0