回文分数

 

“回文分数”游戏并不简单，游戏目标是修改最多maxChanges个字符使得一个字符串的回文分数最高。只允许修改，不许增加或者删除字符。一个字符串的回文分数定义如下：

 

- 如果字符串不是回文串，则分数为0。

- 如果字符串是回文串，且长度为奇数，则分数为1。

- 如果字符串是回文串，且长度为偶数，设它的一半子串的回文分数为K（两个一半子串得分一定相同），则分数为K + 1。

 

给定一个字符串word和一个int型数maxChanges，返回最多修改maxChanges个字符后最大可能的回文分数。

#include <iostream> using namespace std; int main() { cout<<"Please Input a String:"<<endl; string strPali; cin >> strPali; cout<<"Please Input maxChanges:"<<endl; int maxChanges; cin >> maxChanges; int score = 0; while (true) { cout<<"Creent Palindrome: "<<strPali<<endl; bool bPali = true; int len = strPali.size(); int i = (len - 1) / 2, j = len / 2; for (; i > -1; i--, j++) { cout<<i<<": "<<strPali[i]<<" "<<j<<": "<<strPali[j]<<endl; if (strPali[i] != strPali[j]) { if (maxChanges) { int low = (len + 1) / 2 - 1 - i; int hi = len + len / 2 - 1 - j; cout<<"low: "<<low<<" value: "<<strPali[low]<<" "; cout<<"hi: "<<hi<<" value: "<<strPali[hi]<<" "<<endl; if (strPali[low] == strPali[i] || strPali[i] == strPali[hi]) strPali[j] = strPali[i]; else if (strPali[j] == strPali[hi] || strPali[low] == strPali[j]) strPali[i] = strPali[j]; maxChanges -= 1; }else { cout<<"Could not complete Palindrome!"<<endl; bPali = false; break; } } } if (bPali) { ++score;cout<<"score :"<<score<<endl; if (len % 2 == 0) strPali.erase (strPali.size() / 2, strPali.size()); else break; }else break; } cout<<"score: "<<score<<endl; return 0; }