Leetcode 0005: Longest Palindromic Substring

最新推荐文章于 2021-04-25 22:51:32 发布

TTLeoH

最新推荐文章于 2021-04-25 22:51:32 发布

阅读量277

点赞数

分类专栏： leetcode 文章标签： leetcode java 算法字符串

本文链接：https://blog.csdn.net/weixin_43946031/article/details/113798830

版权

给定一个字符串`s`，返回`s`中最长的回文子串。例如，输入`s = “babad”`，输出可以是`“bab”`或`“aba”`。当回文子串长度为奇数时，从当前位置开始向两边扩散；为偶数时，从当前位置和下一个位置开始向两边扩散。时间复杂度为O(n^2)。

摘要由CSDN通过智能技术生成

题目描述：

Given a string s, return the longest palindromic substring in s.

Example 1:

Input: s = “babad”
Output: “bab”
Note: “aba” is also a valid answer.

Example 2:

Input: s = “cbbd”
Output: “bb”

Example 3:

Input: s = “a”
Output: “a”

Example 4:

Input: s = “ac”
Output: “a”

Constraints:

1 <= s.length <= 1000
s consist of only digits and English letters (lower-case and/or upper-case),

Time complexity: $\Omicron(n^{2})\,$

最低0.47元/天解锁文章

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

立即使用

TTLeoH

关注关注

0
点赞
踩
1

收藏

觉得还不错? 一键收藏
0
评论
复制链接

分享到 QQ

分享到新浪微博

扫一扫

专栏目录

LeetCode 5. Longest Palindromic Substring 最长回文子串 C#

wf824284257的博客

02-28

482

前言本文介绍了 LeetCode 第 5 题 , “Longest Palindromic Substring”, 也就是 “最长回文子串” 的问题. 本文使用 C# 语言完成题目，介绍了中心扩展法、马拉车算法等多种方法供大家参考。题目 English LeetCode 5. Longest Palindromic Substring Given a string s, find th...

Given a string S, find the longest palindromic substring in S.

ahen13519的博客

06-09

185

题义很明细：求一个字符串S中的最长回文！基本想法： for-loop i从0 – (n-1)遍历该字符串，从S[i] 或者 S[i+1]开始，向字符串S的两侧展开，判断是不是回文。如果是，再和当前的最长回文比较，如果更长，则替换当前最长的回文。代码如下： // 从c1, c2开始向两侧展开，找到最长的palindrome // e.g. 如果已经知道 "a...

参与评论您还未登录，请先登录后发表或查看评论

5. Longest Palindromic Substring (经典题)

Sterben_Da的博客

04-25

243

5.Longest Palindromic Substring Medium 10497679Add to ListShare Given a strings, returnthe longest palindromic substringins. Example 1: Input: s = "babad" Output: "bab" Note: "aba" is also a valid answer. Example 2: Input: s = "cbbd" Outp...

Given a string s, find the longest palindromic substring in s. You may assume that the maximum lengt

weixin_42108215的博客

05-24

459

def lon(s): outString = "" while len(s) > len(outString): indLen = len(outString) temp = s[: indLen] for ch in s[indLen:]: temp += ch prin...

LeetCode 5. Longest Palindromic Substring？

Tech in Pieces

11-22

147

Given a string s, return the longest palindromic substring in s. return that longest palindrome. this is not some regular dp problems, if i first saw this problem, there is no way I will think of this a dp problem. because we need to return the actual pali

Longest Palindromic Substring(最长回文子串)

IT成长之路

01-24

170

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. 题目的要求是给定一个字符串，找到一个最长的回...

c语言-leetcode 0005-longest-palindromic-substring.zip

最新发布

08-22

c c语言_leetcode 0005_longest_palindromic_substring.zip

LeetCode5 Longest Palindromic Substring

01-09

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Java AC 版本

leetcode答案-Longest-Palindromic-Substring:最长回文子串

06-30

Longest-Palindromic-Substring(最长回文子串) 给定一个字符串 s，找到 s 中最长的回文子串。你可以假设 s 的最大长度为 1000。 Sample 1 输入: "babad" 输出: "bab" 注意: "aba" 也是一个有效答案。 Sample 2 输入...

Leetcode第五题_Longest Palindromic Substring

bigevil的专栏

05-12

818

Longest Palindromic SubstringGiven 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 substrin

LeetCode第五题：Longest Palindromic Substring（c++）详解

WangHuanToBeBest

04-21

470

LeetCode：第五题 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” N...

leetcode挑战2新手讲解向，找出字符串中最长回文串

weixin_37974649的博客

04-14

200

原题给一个字符串，要求返回最长的对称型的子串（又叫最长回文串） Given a string s, return the longest palindromic substring in s. Example 1: Input: s = "babad" Output: "bab" Note: "aba" is also a valid answer. Example 2: Input: s = "cbbd" Output: "bb" Example 3: Input: s = "a" Output:

5. Longest Palindromic Substring

leei9527的博客

03-26

193

题目： Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example: Input: "babad" Output: "bab" Note: "aba" is also a valid answ

LeetCode T5 Longest Palindromic Substring

之虎者也的博客

12-11

174

题目地址：中文：https://leetcode-cn.com/problems/longest-palindromic-substring/ 英文：https://leetcode.com/problems/longest-palindromic-substring/ 题目描述： Given a string s, return the longest palindromic substring in s. Example 1: Input: s = “babad” Output: “bab” Not

5.Longest Palindromic Substring

不很正派的专栏

08-07

281

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example:Input: “babad”Output: “bab”Note: “aba” is also a valid answer.给定一个字符串，找出它的最长回文

LeetCode---5. Longest Palindromic Substring

bingoplus的博客

10-11

308

Description: Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example: Input: “babad” Output: “bab” Note: “aba” is also a valid an

5. Longest Palindromic Substring(java)

katrina95的博客

07-11

268

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

LeetCode #5 最长回文子串动态规划

阿玮的博客

04-06

167

LeetCode #5 最长回文子串题目描述给定一个字符串 s，找到 s 中最长的回文子串。你可以假设 s 的最大长度为 1000。示例 1：输入: "babad" 输出: "bab" 注意: "aba" 也是一个有效答案。示例 2：输入: "cbbd" 输出: "bb" 方法一：暴力法遍历每一个子串，首尾一起往中间靠时间复杂度：O(n3)O(n^3)O(n3) 空间复杂度：...

leedcode解析—Python3—Longest Palindromic Substring—medium

weiwei_wan的博客

04-22

168

题目： Given a string s, return the longest palindromic substring in s. Example 1: Input: s = “babad” Output: “bab” Note: “aba” is also a valid answer. Example 2: Input: s = “cbbd” Output: “bb” Example 3: Input: s = “a” Output: “a” Example 4: Input: s = “ac”