给定一个k进制数a，编程计算最少经过多少次倒置相加运算，a 变成回文数。-given a 229 k a, calculate the number of times at least through inversion combined operations into a palindrome number.

用堆栈实现回文算法 可以测试各种字符串 dos界面-using stack algorithm can achieve Palindrome test string dos interface

都是以前随手编写的笑程序:总的来说只有五个<回文游戏,层次遍历二叉树,猴子选大王,先序、中序、后序遍历的递归算法等等> 如果对你又帮助你就下来看看吧-are readily prepared by the previous laugh : Overall only five lt; Palindrome games, the level traverse binary tree, monkey king election, the first sequence, sequence,