【ProjectEuler】ProjectEuler_004

寻找三位数乘积的最大回文数

最新推荐文章于 2024-12-31 10:07:21 发布

sytzz

最新推荐文章于 2024-12-31 10:07:21 发布

阅读量710

点赞数

CC 4.0 BY-SA版权

分类专栏：【ProjectEuler】【C/C++】文章标签： numbers string class

本文链接：https://blog.youkuaiyun.com/sytzz/article/details/6938576

【C/C++】同时被 2 个专栏收录

57 篇文章

订阅专栏

【ProjectEuler】

55 篇文章

订阅专栏

本文探讨了如何通过编程找到三位数相乘得到的最大回文数，详细介绍了算法实现过程及优化策略。

// A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91  99.
// 
// Find the largest palindrome made from the product of two 3-digit numbers.

using System;
using System.Collections.Generic;
using System.Text;

namespace projecteuler004
{
    class Program
    {
        static void Main(string[] args)
        {
            DateTime timeStart = DateTime.Now;
            int k;
            int maxPalindromin = int.MinValue;
            int maxI = 0;
            int maxJ = 0;
            for (int i = 999; i >= 100; i--)
            {

                int j;
                int dej;
                if (i % 11 == 0)
                {
                    j = 999;
                    dej = 1;
                }
                else
                {
                    j = 990;
                    dej = 11;
                }

                for (; j >= i; j-=dej)
                {
                    k = i * j;
                    if (isPalindromin(k) && maxPalindromin < k)
                    {
                        maxPalindromin = k;
                        maxI = i;
                        maxJ = j;
                    }
                }
            }
            Console.WriteLine("The largest palindrome made from the product of two 3-digit numbers is\n" + maxPalindromin + " = " + maxI + " * " + maxJ);
            Console.WriteLine("Total Milliseconds is " + DateTime.Now.Subtract(timeStart).TotalMilliseconds);
        }

        /// <summary>
        /// 判断是否为循环数
        /// </summary>  012345=6   01234=5
        /// <param name="number"></param>
        /// <returns></returns>
        private static bool isPalindromin(int number)
        {
            string numberStr = number.ToString();
            int lenth = numberStr.Length;
            for (int i = numberStr.Length / 2; i >= 0; i--)
            {
                if (numberStr[i] != numberStr[lenth - i - 1])
                {
                    return false;
                }
            }
            return true;
        }
    }
}

/*
The largest palindrome made from the product of two 3-digit numbers is
906609 = 913 * 993
Total Milliseconds is 32.0041

By GodMoon
*/