LeetCode 5 - Longest Palindromic Substring

最新推荐文章于 2025-12-21 16:42:37 发布

原创最新推荐文章于 2025-12-21 16:42:37 发布 · 250 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

9 篇文章

订阅专栏

本文探讨了如何在给定字符串中找到最长的回文子串，并提供了相应的算法实现。

Longest Palindromic Substring Nov 11 '11

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.

class Solution {
public:
    string longestPalindrome(string s) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
    }
};