三天一题-16-Longest Palindromic Substring

最新推荐文章于 2021-02-21 14:43:18 发布

yanguo110

最新推荐文章于 2021-02-21 14:43:18 发布

阅读量95

点赞数

分类专栏：慢慢爬之轻算法

本文链接：https://blog.csdn.net/yanguo110/article/details/97493090

版权

慢慢爬之轻算法专栏收录该内容

49 篇文章 0 订阅

订阅专栏

题目地址：Longest Palindromic Substring

描述：Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.(求最大的回文数)

Example 1:
Input: "babad"
Output: "bab"
Note: "aba" is also a valid answer.
Example 2:
Input: "cbbd"
Output: "bb"
在这里插入图片描述

public class LongestPalindrome {
    public static void main(String[] args) {
        String str ="abckdllsdb";
        long start = System.nanoTime();
        String res = longestPalindrome(str);
        System.out.println(System.nanoTime()-start);
        System.out.println(res);
    }
    public static  String longestPalindrome(String str){
        int length = str.length();
        int count = 0;
        int star =0;
        for (int i = 0; i <length ; i++) {
            char c = str.charAt(i);
            for (int j = i+1; j < length; j++) {
                if (c==str.charAt(j) && j-i >count ) {
                    count =j-i;
                    star =i;
                }
            }
        }
        return str.substring(star,star+count+1);

    }
}