C#实现：给定任意要给字符串，输出所有可能的回文的子字符串集合。

class Program
    {
        static void Main(string[] args)
        {
            string testStr = "sdfadfdsfadfdsfsdf";
            int length = testStr.Length;
            while (length > 1)
            {

                getPalindrome(testStr.Substring(0, length - 1), testStr.Substring(length - 1), new List<string>());

                --length;
            }

            Console.ReadKey();
        }

        /// <summary>
        /// 
        /// </summary>
        /// <param name="s"></param>
        /// <returns></returns>
        static void getPalindrome(string subLeft, string subRight, List<string> leftPalindromeStr)
        {


            int length = subRight.Length;
            List<string> palindromeStrs = leftPalindromeStr;

            if (isPalindrome(subLeft) == true)
            {
                palindromeStrs.Add(subLeft);
                if (isPalindrome(subRight))
                {
                    Console.WriteLine("{0},{1}", String.Join(",", palindromeStrs), subRight);
                }

                while (length > 1)
                {
                    List<string> ss = new List<string>();
                    ss.AddRange(palindromeStrs);
                    getPalindrome(subRight.Substring(0, length - 1), subRight.Substring(length - 1), ss);
                    length--;
                }
            }
        }

        static bool isPalindrome(string str)
        {
            int length = str.Length;
            int half = length / 2;

            for (int i = 0; i < half; i++)
            {
                if (str[i] != str[length - i - 1])
                {
                    return false;
                }
            }

            return true;
        }
    }

 

转载于:https://www.cnblogs.com/haizzh/p/6144583.html