Question

我正在研究Euler项目的第8个问题。该脚本应该找到13个相邻数字的最大乘积。我的答案是2091059712，但是项目Euler说这是错误的。我的预期输出是23514624000（欧拉计画所说的是正确的答案），但这不是我得到的。谁能帮我？感谢所有帮助，谢谢！

代码如下：

public class Script_8
{
    public static void main ( String [] args )
    {
        String number = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450";
        int length = number.length();
        System.out.println(length);
        int[] numbers_array;
        long total;
        numbers_array = new int[length];
        for ( int i = 0; i < length; i ++)
        {
            numbers_array[i] = Integer.parseInt(number.substring(i, i + 1));
        }
        long highest_total = 0L;
        for ( int x = 0; x < length-12; x ++)
        {
            total = (numbers_array[x] * numbers_array[x+1] * numbers_array[x+2] * numbers_array[x+3] * numbers_array[x+4] * numbers_array[x+5] * numbers_array[x+6] * numbers_array[x+7] * numbers_array[x+8] * numbers_array[x+9] * numbers_array[x+10] * numbers_array[x+11] * numbers_array[x+12]);
            System.out.println(total);
            System.out.println(highest_total);
            if ( total > highest_total )
            {
                highest_total = total;
            }
        }
        System.out.println(highest_total);
   }
}

Answer 1

将int[] numbers_array更改为long[] numbers_array以避免在12个整数相乘时溢出。您还需要使用Long.parseLong()

13个相邻数字的最大和

1 个答案: