fix: упрощено формирование вопроса в Progression (использован String.join)

Author: Mercer241

app/src/main/java/hexlet/code/games/Progression.java

@@ -26,34 +26,21 @@ private static String[] generateRound() {
         int length = Utils.generateNumber(MIN_LENGTH, MAX_LENGTH);
         int start = Utils.generateNumber(MIN_START, MAX_START);
         int step = Utils.generateNumber(MIN_STEP, MAX_STEP);
-        int hiddenPosition = Utils.generateNumber(0, length - 1);
+        int hiddenIndex = Utils.generateNumber(0, length - 1);
 
-        int[] progression = generateProgression(start, step, length);
+        String[] progression = makeProgression(start, step, length);
+        String correctAnswer = progression[hiddenIndex];
+        progression[hiddenIndex] = "..";
+        String question = String.join(" ", progression);
 
-        String question = hideElement(progression, hiddenPosition);
-
-        int hiddenNumber = progression[hiddenPosition];
-
-        return new String[] {question, Integer.toString(hiddenNumber)};
+        return new String[] {question, correctAnswer};
     }
 
-    private static int[] generateProgression(int start, int step, int length) {
-        int[] progression = new int[length];
+    private static String[] makeProgression(int start, int step, int length) {
+        String[] progression = new String[length];
         for (int i = 0; i < length; i++) {
-            progression[i] = start + i * step;
+            progression[i] = Integer.toString(start + i * step);
         }
         return progression;
     }
-
-    private static String hideElement(int[] progression, int hiddenPosition) {
-        String[] result = new String[progression.length];
-        for (int i = 0; i < progression.length; i++) {
-            if (i == hiddenPosition) {
-                result[i] = "..";
-            } else {
-                result[i] = Integer.toString(progression[i]);
-            }
-        }
-        return String.join(" ", result);
-    }
-}
+}