項目歐拉8

Question

我讀過一些項目歐拉問題8的主題。但我不知道爲什麼我的代碼給了我錯誤的答案。

package main; 

import java.util.ArrayList; 

public class Euler8 { 

public static void main(String[] args) { 
    String bigNumber = "73167176531330624919225119674426574742355349194934" 
      + "96983520312774506326239578318016984801869478851843" 
      + "85861560789112949495459501737958331952853208805511" 
      + "12540698747158523863050715693290963295227443043557" 
      + "66896648950445244523161731856403098711121722383113" 
      + "62229893423380308135336276614282806444486645238749" 
      + "30358907296290491560440772390713810515859307960866" 
      + "70172427121883998797908792274921901699720888093776" 
      + "65727333001053367881220235421809751254540594752243" 
      + "52584907711670556013604839586446706324415722155397" 
      + "53697817977846174064955149290862569321978468622482" 
      + "83972241375657056057490261407972968652414535100474" 
      + "82166370484403199890008895243450658541227588666881" 
      + "16427171479924442928230863465674813919123162824586" 
      + "17866458359124566529476545682848912883142607690042" 
      + "24219022671055626321111109370544217506941658960408" 
      + "07198403850962455444362981230987879927244284909188" 
      + "84580156166097919133875499200524063689912560717606" 
      + "05886116467109405077541002256983155200055935729725" 
      + "71636269561882670428252483600823257530420752963450" 
      ; 
    ArrayList<Integer> myArray = new ArrayList<Integer>(); 
    int counter = 1; 
    int current = 0; 
    int product = 1; 
    int maximumProduct = 0; 
    for(int i = 0; i < bigNumber.length(); i++) { 
     String b = "" + bigNumber.charAt(i); 
     current = Integer.parseInt(b); 
     myArray.add(current); 
     if(counter % 5 == 0) { 

      for(int x : myArray) { 
       product = x * product; 
      } 
      if(product > maximumProduct) { 
       maximumProduct = product; 
      } 
      myArray.clear(); 
      product = 1; 
     } 
     counter++; 
    } 
    System.out.println(maximumProduct); 
    } 
} 

我得到的答案和31752右邊一個是40824.由於這是一門功課，我不能複製解決問題，所以我想在我的原因代碼是不工作的任何解釋所以我可以修復它。

謝謝。

Answer 1

你沒有考慮乘法的正確元素。被乘以連續5個數字，每個數字獲得每個產品下面的代碼在myArray

public static void main(String[] args) {    
    String bigNumber = "73167176531330624919225119674426574742355349194934" 
       + "96983520312774506326239578318016984801869478851843" 
       + "85861560789112949495459501737958331952853208805511" 
       + "12540698747158523863050715693290963295227443043557" 
       + "66896648950445244523161731856403098711121722383113" 
       + "62229893423380308135336276614282806444486645238749" 
       + "30358907296290491560440772390713810515859307960866" 
       + "70172427121883998797908792274921901699720888093776" 
       + "65727333001053367881220235421809751254540594752243" 
       + "52584907711670556013604839586446706324415722155397" 
       + "53697817977846174064955149290862569321978468622482" 
       + "83972241375657056057490261407972968652414535100474" 
       + "82166370484403199890008895243450658541227588666881" 
       + "16427171479924442928230863465674813919123162824586" 
       + "17866458359124566529476545682848912883142607690042" 
       + "24219022671055626321111109370544217506941658960408" 
       + "07198403850962455444362981230987879927244284909188" 
       + "84580156166097919133875499200524063689912560717606" 
       + "05886116467109405077541002256983155200055935729725" 
       + "71636269561882670428252483600823257530420752963450" 
       ; 

       ; 
     ArrayList<Integer> myArray = new ArrayList<Integer>(); 
     int counter = 1; 
     int current = 0; 
     int product = 1; 
     int maximumProduct = 0; 
     for(int i = 0; i < bigNumber.length(); i++) { 
      String b = "" + bigNumber.charAt(i); 
      current = Integer.parseInt(b); 
      myArray.add(current); 
      counter++; 
      if(counter == 5) { 
       for(int x : myArray) { 
        product = x * product; 
       } 
       if(product > maximumProduct) { 
        maximumProduct = product; 

       } 
       myArray.remove(0); 
       product = 1; 
      } 
      counter=myArray.size(); 
     } 
     System.out.println(maximumProduct); 
     } 
} 

查看保存這些數字也Greatest product of five consecutive digits in a 1000-digit number