Home >Web Front-end >JS Tutorial >Longest Palindromic Substring
Given a string s, return the longest
palindromic
substring
in s.
Example 1: Input: s = "babad" Output: "bab" Explanation: "aba" is also a valid answer. Example 2: Input: s = "cbbd" Output: "bb"
Constraints:
1 <= s.length <= 1000
s consist of only digits and English letters.
var longestPalindrome = function(s) { let res = ""; let max = 0; for(let i = 0; i < s.length; i++){ for(let j = 0; j <= 1; j++){ let l = i; let r = i + j; while(l >= 0 && r < s.length && s[l] === s[r]){ let len = r - l + 1; if(len > max){ res = s.substring(l, r + 1); max = len; } l--; r++; } } } return res; };The above is the detailed content of Longest Palindromic Substring. For more information, please follow other related articles on the PHP Chinese website!