LeetCode刷题(C++)——Longest Palindromic Substring(Medium)

来源:互联网 发布:org.apache.ant jar 编辑:程序博客网 时间:2024/06/18 04:09

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"Output: "bb"

class Solution {public:    string longestPalindrome(string s) {        string str;if (s.empty())return str;int maxlength = 0;for (size_t i = 0; i< s.size();i++){for (size_t j = i+maxlength;j < s.size();j++){if (isPalindromic(s.substr(i, j - i + 1))){int length = j - i + 1;if (length > maxlength){maxlength = length;str = s.substr(i, j - i + 1);}}}}return str;}bool isPalindromic(string s){if (s.empty())return true;int i = 0;int j = s.size() - 1;while (i <= j){if (s[i] != s[j])return false;++i;--j;}return true;    }};


1 0
原创粉丝点击