[LeetCode]-005-Longest Palindromic Substring

网址：https://leetcode.com/problems/longest-palindromic-substring/

题意：

找出最长回文字符串.

解法1：

自然是暴力枚举,把每一个元素从中间往左右遍历,如果是且是最长的存下字符串.

比如abccba.

定位元素是2->c.

找左1->b.不行

找右3->c.可以->找左右同时->找左右同时

找左右同时.不行

思路就是试3次,只要有可以的就试到底.

代码：

https://github.com/LiLane/leetcode/blob/master/java/005-LongestPalindromicSubstring-201504282020.java

https://github.com/LiLane/leetcode/blob/master/c%2B%2B/005-LongestPalindromicSubstring-201504282020.cpp

解法2：

动规,把两个下标(开始和结束)记录,这样就不用记录字符串,

先遍历距离0和1的所有子元素.

再根据flag[left+1][right-1]和s[left]==s[right]这种模式来判断是不是回文.

在这种情况,解法2并不比解法1更优.

但代码更加具有威力,

当逻辑更加复杂时,解法2一定比解法1更容易改动、优化、理解.

代码：

https://github.com/LiLane/leetcode/blob/master/java/005-LongestPalindromicSubstring-201504282100.java

https://github.com/LiLane/leetcode/blob/master/c%2B%2B/005-LongestPalindromicSubstring-201504282053.cpp

时间： 2024-10-07 16:09:09

[LeetCode]-005-Longest Palindromic Substring的相关文章

Java for LeetCode 005 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. 解题思路一: 暴力枚举共N^2量级个子串(从下标零开始),每次检查需一个for循环,等于是3重for循环,时间复杂度O(n^3) 解题思路二: 动态

LeetCode 005 Longest Palindromic Substring - Java

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. Example: Input: "cbbd" Ou

[LeetCode] 005. Longest Palindromic Substring (Medium) (C++/Java/Python)

索引:[LeetCode] Leetcode 题解索引 (C++/Java/Python/Sql) Github: https://github.com/illuz/leetcode 005.Longest_Palindromic_Substring (Medium) 链接: 题目:https://oj.leetcode.com/problems/Longest-Palindromic-Substring/ 代码(github):https://github.com/illuz/leetcode

【LeetCode】005 Longest Palindromic Substring

题目:LeetCode 005 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. 题意:字符串S,找到S中的最长回文子串.假定S最长为100

LeetCode #5 Longest Palindromic Substring (M)

[Problem] 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. [Analysis] 这题的思路有很多种,网上也有各种讨论.这里我采用的是个人觉得比较好理解的一种利用Dynamic Progra

LeetCode(4) || Longest Palindromic Substring 与 Manacher 线性算法

LeetCode(4) || Longest Palindromic Substring 与 Manacher 线性算法题记本文是LeetCode题库的第五题,没想到做这些题的速度会这么慢,工作之余全部耗在这上面了,只怪自己基础差.本文主要介绍使用Manacher线性算法来求解字符串的最长回文子字符串. 题目 Given a string S, find the longest palindromic substring in S. You may assume that the maxim

LeetCode：Longest Palindromic Substring

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. 动态规划解法 T(n) = O(n^2) ,S(n) = O(n^2); Solutio

LeetCode-Algorithms #005 Longest Palindromic Substring, Database #179 Consecutive Numbers

LeetCode-Algorithms #005 Longest Palindromic Substring 英语学习时间palindromic: [医] 复发的, 再发的在数学和计算机上,就指回文这道题目就是找出给定字符串中最长的回文子串, 可以假定原字符串的长度不超过1000 直接遍历来做肯定是不难, 但也可以想见一定是慢得可以. 那么我的另一个想法是, 从原串中的每一个字符, 或每两个字符中间的空隙开始, 向左右两边判断是否为回文串, 最后找出最长的 1 class Solution

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 assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. 动态规划,类似于l