Find all palindrome substrings

最新推荐文章于 2020-11-27 22:14:56 发布

liyuanda888

最新推荐文章于 2020-11-27 22:14:56 发布

阅读量317

点赞数 1

本文链接：https://blog.csdn.net/liyuanda888/article/details/52658385

版权

本文介绍了一种在给定字符串中查找所有回文子串的方法。通过插入特殊字符简化遍历过程，并使用表格记录不同长度回文串的位置及长度。最终输出所有找到的回文子串。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Find all palindrome substrings

Code:

// Find all palindrome substrings in a given string
// (C)2012 mgr Jerzy Wałaszek
//-----------------------------

#include <iostream>
#include <string>
#include <cstdlib>
#include <time.h>

using namespace std;

string s = "abcacbbbca";   // string to be analyzed
const int N = 10;          // length of s 

int main()
{
  int i, j, k,   // iterators
      rp,        // length of 'palindrome radius'
      R[2][N+1]; // table for storing results (2 rows for odd- and even-length palindromes 

// print s first

  cout << s << endl;

// ...then search for palindromes

  s = "@" + s + "#"; // insert 'guards' to iterate easily over s

  for(j = 0; j <= 1; j++)
  {
    R[j][0] = rp = 0; i = 1;
    while(i <= N)
    {
      while(s[i - rp - 1] == s[i + j + rp]) rp++;
      R[j][i] = rp;
      k = 1;
      while((R[j][i - k] != rp - k) && (k < rp))
      {
        R[j][i + k] = min(R[j][i - k],rp - k);
        k++;
      }
      rp = max(rp - k,0);
      i += k;
    }
  }

  s = s.substr(1,N); // remove 'guards'


// print the results

  for(i = 1; i <= N; i++)
  {
    for(j = 0; j <= 1; j++)
      for(rp = R[j][i]; rp > 0; rp--)
      {
        for(k = 1; k < i - rp; k++) cout << " ";
        cout << s.substr(i - rp - 1,2 * rp + j) << endl;
      }
  }
  cout << endl;
  return 0;
}

Output:

abcacbbbca
 bcacb
  cac
     bb
   acbbbca
    cbbbc
     bbb
      bb