19.1.20 [LeetCode 5]Longest Palindromic Substring

阿新 • • 發佈：2019-01-20

str you mil pub sub subst opened col bst

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"

 1 class Solution {
 2 public:
 3     string longestPalindrome(string 
 s) {
 4         int leng = 0, size = s.length();
 5         string p;
 6         for (int i = 0; i<size; i++) {
 7             int l = 1;
 8             int S = i, E = i;
 9             while (S > 0 && E < size - 1 && s[S - 1] == s[E + 1]) {
10                 S--, E++;
 
11                 l += 2;
12             }
13             if (l > leng) {
14                 p = s.substr(S, l);
15                 leng = l;
16             }
17         }
18         for (int i = 0; i < size-1; i++) {
19             if (i + 1 > size - 1)break;
20             int l = 0 
;
21             int S = i+1, E = i;
22             while (S > 0 && E < size - 1 && s[S - 1] == s[E + 1]) {
23                 S--, E++;
24                 l += 2;
25             }
26             if (l > leng) {
27                 p = s.substr(S, l);
28                 leng = l;
29             }
30         }
31         return p;
32     }
33 };

View Code

從大小為1或2的回文串開始擴展

19.1.20 [LeetCode 5]Longest Palindromic Substring

str you mil pub sub subst opened col bst Given a string s, find the longest palindromic substring in s. You may assume that the maximum l

LeetCode - 5 - Longest Palindromic Substring

ems nbsp 偶數運行時 ges style string -1 lee 題目 URL：https://leetcode.com/problems/longest-palindromic-substring 解法一、循環搜索對於每一個字符，往後搜索，遇到相同

Leetcode 5. Longest Palindromic Substring

int style valid sum nbsp next htm targe 回文 Given a string s, find the longest palindromic substring in s. You may assume that the maximum

Leetcode 5: Longest Palindromic Substring

amp input tmp esc -- solution pan else bst Given a string s, find the longest palindromic substring in s. You may assume that the maximu

[LeetCode] 5 Longest Palindromic Substring

一個 () i++ blog 因此 str 技術 rip right 題目地址： https://leetcode.com/problems/longest-palindromic-substring/description/ 題目：其實就是求一個字符串的最長回文子

Leetcode:5- Longest Palindromic Substring

main mes family sub long etc 擴展 input 最長 Given a string s, find the longest palindromic substring in s. You may assume that the maximum l

leetcode-5-Longest Palindromic Substring

tar 空間復雜度 lan long 最長回文子串最長回文算法 bmi solution 題目：Longest Palindromic Substring Given a string s, find the longest palindromic substr

LeetCode 5. Longest Palindromic Substring (DP)

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"

[leetcode] 5. Longest Palindromic Substring (Medium)

原題連結找到並返回最長迴路子串思路：解法一：最簡單的雙重遍歷，判斷s[i]到s[j]是不是回串。 Runtime: 610 ms, faster than 6.39% of Java 慢的不行 class Solution { public String longestPal

#Leetcode# 5. Longest Palindromic Substring

https://leetcode.com/problems/longest-palindromic-substring/ Given a string s, find the longest palindromic substring in s. You may assu

#Leetcode# 5. Longest Palindromic Substring

www. size 題解 nac problems ring mic 最長回文回文 https://leetcode.com/problems/longest-palindromic-substring/ Given a string s, find the long

LeetCode.5. Longest Palindromic Substring

https://leetcode.com/problems/longest-palindromic-substring/ 找到最長的迴文子串。一種方法是從頭到尾遍歷一次，在每次迭代中，以當前字元為中心，像兩側擴充套件判斷是否為迴文。然後以當前為中心最長的那個迴文串，並記錄下最長的

LeetCode:5. Longest Palindromic Substring(Week 3)

5. Longest Palindromic Substring 題目 Given a string s, find the longest palindromic substring in s. You may assume that the maximu

LeetCode-5 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:

LeetCode——5.Longest Palindromic Substring

1.題目詳情 Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. 給出一個字串s

leetcode-5:Longest Palindromic Substring 最長迴文子串

題目： Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1

LeetCode 5. Longest Palindromic Substring 最長迴文子串 Python 四種解法(Manacher 動態規劃)

Longest Palindromic Substring 最長迴文子串學習筆記 1. Brute method 第一種方法：直接迴圈求解，o(n2)o(n2) class Solution: def longestPalindrome(self, s):

[leetcode]5.Longest Palindromic Substring

自己的暴力解法果真超時了，但是很開心有進步，能把自己腦子裡的演算法給順利翻譯出來了，比剛開始做第一題的感覺好多了，開心。暴力解法：遍歷 class Solution { public String longestPalindrome(String s)

leetcode: 5. Longest Palindromic Substring

Difficulty Medium Description /** * Given a string s, find the longest palindromic substring in s. You may assume that the maximum length o

Leetcode 5. Longest Palindromic Substring 最長迴文子串

Leetcode 5. Longest Palindromic Substring 最長迴文子串標籤： Leetcode 題目地址：https://leetcode-cn.com/problems/longest-palindromic-substring/ 題目描述

19.1.20 [LeetCode 5]Longest Palindromic Substring

相關推薦