5. Longest Palindromic Substring

最新推荐文章于 2024-09-13 18:11:35 发布

Line290

最新推荐文章于 2024-09-13 18:11:35 发布

阅读量394

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/Line290/article/details/78035268

版权

leetcode 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

class Solution {
    bool IsPalindrome(string s, int low, int high) {
        while(low <= high) {
            if(s[low] != s[high]) return false;
            low++;
            high--;
        }
        return true;
    }
public:
    string longestPalindrome(string s) {
        int low = 0;
        int maxlength = 0;
        int length = 0;
        int maxlow = 0, maxhigh = 0;
        while(low + maxlength < s.size()) { // or while(s.size() - 1 - low + 1 > maxlength)
            for(int i = low + maxlength; i < s.size(); i++) {//maybe faster if direction is from right to left
                if(s[low] == s[i]) {
                    if(IsPalindrome(s, low, i)) {
                        length = i -low + 1;
                        if(length > maxlength) {
                            maxlength = length;
                            maxlow = low;
                            maxhigh = i;
                        }
                    }
                }
            }
            low++;
        }
        return s.substr(maxlow, maxlength);
    }
};

很简单的想法，

从左到右遍历， one by one， O（n**2)

-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

O(n)

from:http://blog.csdn.net/feliciafay/article/details/16984031

    // Transform S into T.  
    // For example, S = "abba", T = "^#a#b#b#a#$".  
    // ^ and $ signs are sentinels appended to each end to avoid bounds checking  
    string preProcess(string s) {  
      int n = s.length();  
      if (n == 0) return "^$";  
      string ret = "^";  
      for (int i = 0; i < n; i++)  
        ret += "#" + s.substr(i, 1);  
       
      ret += "#$";  
      return ret;  
    }  
       
    string longestPalindrome(string s) {  
      string T = preProcess(s);  
      int n = T.length();  
      int *P = new int[n];  
      int C = 0, R = 0;  
      for (int i = 1; i < n-1; i++) {  
        int i_mirror = 2*C-i; // equals to i' = C - (i-C)  
          
        P[i] = (R > i) ? min(R-i, P[i_mirror]) : 0;  
          
        // Attempt to expand palindrome centered at i  
        while (T[i + 1 + P[i]] == T[i - 1 - P[i]])  
          P[i]++;  
       
        // If palindrome centered at i expand past R,  
        // adjust center based on expanded palindrome.  
        if (i + P[i] > R) {  
          C = i;  
          R = i + P[i];  
        }  
      }  
       
      // Find the maximum element in P.  
      int maxLen = 0;  
      int centerIndex = 0;  
      for (int i = 1; i < n-1; i++) {  
        if (P[i] > maxLen) {  
          maxLen = P[i];  
          centerIndex = i;  
        }  
      }  
      delete[] P;  
        
      return s.substr((centerIndex - 1 - maxLen)/2, maxLen);  
    }