refactor: ANSWER_LENGTH 사용 위치 변경

Author: Sehee-Lee-01

src/main/java/sehee/answer/AnswerFactory.java

@@ -9,13 +9,13 @@ public record AnswerFactory(
 ) {
 
     public Answer make() {
-        int[] numbers = numberMaker.makeAllUnique(ANSWER_LENGTH);
+        int[] numbers = numberMaker.makeAllUnique();
 
         return new Answer(numbers);
     }
 
     public Answer make(int[] numbers) {
-        AnswerNumberValidator.check(numbers, ANSWER_LENGTH);
+        AnswerNumberValidator.check(numbers);
 
         return new Answer(numbers);
     }

src/main/java/sehee/answer/AnswerNumberValidator.java

@@ -1,10 +1,12 @@
 package sehee.answer;
 
+import static sehee.util.constant.RandomNumberGameConstant.ANSWER_LENGTH;
+
 // package-private
 final class AnswerNumberValidator {
 
-    static void check(int[] numbers, int length) {
-        checkLength(numbers, length);
+    static void check(int[] numbers) {
+        checkLength(numbers, ANSWER_LENGTH);
         checkAllUnique(numbers);
     }
 

src/main/java/sehee/util/numbermaker/NumberMaker.java

@@ -4,6 +4,6 @@ public interface NumberMaker {
 
     int make();
 
-    int[] makeAllUnique(int length);
+    int[] makeAllUnique();
 
 }

src/main/java/sehee/util/numbermaker/RandomNumberMaker.java

@@ -1,5 +1,7 @@
 package sehee.util.numbermaker;
 
+import static sehee.util.constant.RandomNumberGameConstant.ANSWER_LENGTH;
+
 import java.util.Random;
 
 // package-private
@@ -15,11 +17,11 @@ public int make() {
         return random.nextInt(9) + 1;
     }
 
-    public int[] makeAllUnique(int length) {
+    public int[] makeAllUnique() {
         boolean[] isExist = new boolean[10];
         isExist[0] = true;
 
-        int[] randomNumbers = new int[length];
+        int[] randomNumbers = new int[ANSWER_LENGTH];
         int count = 0;
         while (count < randomNumbers.length) {
             count = makeAndCountUnique(isExist, randomNumbers, count);