LeetCode 5 Longest Palindromic Substring

最新推荐文章于 2022-08-23 18:24:49 发布

萤火虫啊飞呀飞

最新推荐文章于 2022-08-23 18:24:49 发布

阅读量114

点赞数

分类专栏： leetcode 文章标签： leetcode 回文字符串

本文链接：https://blog.csdn.net/shey666/article/details/79577778

版权

leetcode 专栏收录该内容

109 篇文章 0 订阅

订阅专栏

LeetCode 5

Longest Palindromic Substring

Problem Description：
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"
Solution:

class Solution {
public:
    string longestPalindrome(string s) {
        int maxlength = 0;
        int start = 0;
        int stop = 0;
        int flag = 0;  //用flag来标识是否回文子字符串
        int circle = 0;
        int begin = 0; //用begin来标识最长回文子字符串的起始位置
        int end = 0; //用end来标识最长回文子字符串的结束位置
        string result = "";
        for (int i = 0; i < s.length(); i++) {
            for (int j = i; j < s.length(); j++) {
                if (i < j) {
                    start = i;
                    stop = j;
                    while(start < stop) {
                        if (s[start] != s[stop]) {
                            circle = 1;
                            break;
                        }
                        start++;
                        stop--;
                    }
                    if (circle == 0)
                        flag = 1;
                } else {
                    flag = 1;
                }
                if (flag) {
                    int len = j-i+1;
                    if (len > maxlength) {
                        maxlength = len;
                        begin = i;
                        end = j;
                     }
                }
                flag = 0;
                circle = 0;
            }
        }
        for (int k = begin; k <= end; k++) {
            result += s[k];
        }
        return result;
    }
};