数组大小声明

Question

我已经在下面发布了我的代码。我在声明数组wrongAnswers的行有一个问题。我以前能够让我的代码工作，但问题是有些人自己删除了我的所有文件。我能够在不使用List或ArrayList的情况下工作。我只想了解，在尝试使用其他方法之前，我现在可以如何开始工作。我明白Java数组是不可变的。不过，我仍然可以在以前的某个方面做到这一点。如果有人能帮我弄清楚我以前做过什么，我会非常感激。

private Scanner keyboard = new Scanner(System.in); 

private final String[] testAnswers = { 
     "B","D","A","A","C", 
     "A","B","A","C","D", 
     "B","C","D","A","D", 
     "C","C","B","D","A"}; 
private String[] studentAnswers = new String[20]; 
/* 
private String[] studentAnswers = { 
     "B","D","A","A","C", 
     "A","B","A","C","D", 
     "B","C","D","A","D", 
     "C","C","B","D","A"}; 
*/ 
private int[] wrongAnswers; 
private int answeredCorrectly = 0; 

public void getStudentAnswers() { 
    for(int x = 0; x < 20; x++) { 
     do { 
      System.out.print("Enter answer for #" + (x + 1) + " : "); 
      this.studentAnswers[x] = keyboard.next().toUpperCase(); 
      if (!"A".equals(this.studentAnswers[x]) && 
        !"B".equals(this.studentAnswers[x]) && 
        !"C".equals(this.studentAnswers[x]) && 
        !"D".equals(this.studentAnswers[x])) { 
       System.out.println("Invalid input."); 
      } 
     } while(!"A".equals(this.studentAnswers[x]) && 
       !"B".equals(this.studentAnswers[x]) && 
       !"C".equals(this.studentAnswers[x]) && 
       !"D".equals(this.studentAnswers[x])); 
    } 
} 

public int totalCorrect() { 
    int arrayLocation = 0; 

    for(int x = 0; x < 20; x++) { 
     if (this.studentAnswers[x].equals(this.testAnswers[x])) 
      this.answeredCorrectly++; 
     else 
      this.wrongAnswers[arrayLocation++] = x; 
    } 

    return this.answeredCorrectly; 
} 

public int totalIncorrect() { 
    return 20 - this.answeredCorrectly; 
} 

public boolean passed() { 
    return this.answeredCorrectly >= 15; 
} 

public void questionsMissed() { 
    if(this.answeredCorrectly != 20) { 
      for(int x = 0; x < this.wrongAnswers.length; x++) { 
      System.out.println(this.wrongAnswers[x]); 
     } 
    } 
} 

Answer 1

如果代码编写得很好，节省空间（这是您要做的）通常会降低性能，反之亦然。正如你所看到的，你可以达到你想要的，但是你会失去表现。

我发现演绎在解决类似问题时很有用。条件：

1）数组是不可变的 2）要分配的，你需要

2点提出了一个问题空间的确切数额：你怎么知道你需要多大的空间？明显的答案：知道你有多少（正确）答案。从那里你可以做：

public int totalCorrect() { 
    for(int x = 0; x < 20; x++) { 
     if (this.studentAnswers[x].equals(this.testAnswers[x])) 
      this.answeredCorrectly++; 
    } 

    this.wrongAnswers = int[20 - this.answeredCorrectly]; 

    // Here you want to create your wrongAnswers, but you have to go over 
    // the same array twice... 
    int arrayLocation = 0; 
    for(int x = 0; x < 20; x++) { 
     if (!this.studentAnswers[x].equals(this.testAnswers[x])) 
      this.wrongAnswers[arrayLocation++] = x; 
    } 


    return this.answeredCorrectly; 
} 

有可能有更多的方法来做类似的事情，并取得更好的表现。乍一看，他们看起来像我不喜欢的方法，我会使用列表，如已经提出的，或者已经提出，或者一个集合，但谁知道...

Answer 2

private int [] wrongAnswers = new int [20] ;