蠻力算法問題

Question

我已經看過幾次代碼了，但是在聲明的行中，我總是不斷地越界：

sum = sum + vectorArray [z]; }

誰能看到什么問題？

public class HW1 {
    public static void main(String[] args) {

    Scanner input = new Scanner(System.in);

    // The numbers for n are not relevant
    System.out.println("Please enter a number for the length of n.");
    int n = input.nextInt();

    // Creates an array with n values
    int[] vectorArray = new int[n];

    // Inputs random numbers into the array ranging from -100 to 100.
    int dummy;
    int temp = 0;

    // Loop to generate negative and positive numbers into the array
    for (int i = 0; i < n; i++) {

        dummy = (int)(Math.random()*2);
        if (dummy == 0) { 
            temp = -1; 
        } else {
            temp = 1; } 

        vectorArray[i] = ((int)(Math.random()*101)) * temp;
        System.out.println(vectorArray[i]); }

    int max = -1;
    int sum;

    for (int x = 0; x < vectorArray.length; x++) {
        for (int y = x; x < vectorArray.length; y++) {
        sum = 0;
            for (int z = x; z <= y; z++) {
                sum = sum + vectorArray[z]; }
                max = Math.max(max, sum);
        } } 
    System.out.println("The max: " +  max);
    }
}

Answer 1

在for循環中將x更改為y

  for (int y = x; y < vectorArray.length; y++) {

                  ^
 sum = 0;
            for (int z = x; z <= y; z++) {
                sum = sum + vectorArray[z]; }