Longest Palindromic Substring

fanxian2

于 2015-08-05 22:18:43 发布

阅读量210

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/fanxian2/article/details/47305047

版权

leetcode 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

题目

Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.

思路

该问题可以采用自里向外的方法，因为我们知道，假如字符串S是回文串，则xSx也是回文串

代码

public class Solution {
    public String longestPalindrome(String s) {
        String result = "";
        int len = s.length();

        for(int i=0; i<len; i++){
            int m, n;
            m = n = i;
            while(m>=0 && n<len){
                if(s.charAt(m) == s.charAt(n)){
                    m--;
                    n++;
                }else   break;
            }

            if(result.length() < n-m-1) result = s.substring(m+1, n);
            m = i;
            n = i + 1;
            while(m>=0 && n<len){
                if(s.charAt(m) == s.charAt(n)){
                    m--;
                    n++;
                }else   break;
            }

            if(result.length() < n-m-1) result = s.substring(m+1, n);
        }

        return result;
    }
}