leetcode 第五题 Longest Palindromic Substring （java）

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, and there exists one unique longest palindromic substring.

time=255ms accepted 暴力遍历

public String longestPalindrome(String s){String result=null;int length=s.length();int max=0;if(length==0)return null;else if(length==1)return s;else{for(int i=1;i<length;i++){       boolean b=false;int k=0;int j=0;for(int m=i-1;m>=0&&m>=i-2;m--){if(s.charAt(i)==s.charAt(m)){k=m-1;b=true;j=i+1;while(b&&k>=0&&j<length){                     if(s.charAt(j)==s.charAt(k)){j++;k--;}elseb=false;}                       if(max<j-k-1){result=s.substring(k+1,j);max=j-k-1;}}}if(j>=length)break;}return result;}}

转载于:https://www.cnblogs.com/wennian/p/5036918.html

leetcode 第五题 Longest Palindromic Substring （java）相关推荐

【LeetCode】No.5. Longest Palindromic Substring -- Java Version
题目链接: https://leetcode.com/problems/longest-palindromic-substring/ 1. 题目介绍(最长回文子串) Given a string s, ...
leetcode 5 Longest Palindromic Substring Java JavaScript解法
题目详情 Given a string s, find the longest palindromic substring in s. You may assume that the maximum ...
leetcode（5）—— Longest Palindromic Substring（最长回文子串）
longest-palindromic-substring 法1:暴力搜索(但会超时) 遍历全部子串(n+(n−1)+-+1=n(1+n)2n+(n-1)+\ldots+1=\frac{n(1+n)} ...
leetcode雕虫小技medium 5. Longest Palindromic Substring
题干:https://leetcode.com/problems/longest-palindromic-substring/ 分析: 这题据说有个O(n)的解法,我自己写的O(n^2)的解法不是最优 ...
palindromic java_LeetCode(java)5. Longest Palindromic Substring
Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ...
leetcode刷题之旅（5） Longest Palindromic Substring
题目描述 Given a string s, find the longest palindromic substring in s. You may assume that the maximum ...
LeetCode Longest Palindromic Substring
原题链接在这里:https://leetcode.com/problems/longest-palindromic-substring/ 题目: Given a string s, find the ...
【回文串1 动态规划马拉车算法】LeetCode 5. Longest Palindromic Substring
LeetCode 5. Longest Palindromic Substring LeetCode中与回文串相关的免费的题目共有15道(5, 9, 125, 131, 132, 214, 234, ...
LeetCode第三题(Longest Substring Without Repeating Characters)三部曲之一：解题思路
笔者在完成LeetCode第三题(Longest Substring Without Repeating Characters)时,经历了设计.实现.优化三个阶段,于是通过这个三部曲系列,将当初的整个 ...

leetcode 第五题 Longest Palindromic Substring （java）

leetcode 第五题 Longest Palindromic Substring （java）相关推荐

最新文章

热门文章