🚀 3단계 - 사다리(게임 실행)

src/main/java/nextstep/Main.java

@@ -8,10 +8,14 @@ public class Main {
 
     public static void main(String[] args) {
         var players = InputView.inputPlayerNames();
+        var results = InputView.inputResults();
         var height = InputView.inputHeight();
 
         var ladder = new Ladder(players, height);
+        var report = ladder.report(results);
 
-        OutputView.printResult(ladder);
+        OutputView.printResult(ladder, results);
+        OutputView.searchResult(report);
     }
 }
+

src/main/java/nextstep/ladder/Ladder.java

@@ -1,6 +1,8 @@
 package nextstep.ladder;
 
+import java.util.HashMap;
 import java.util.List;
+import java.util.Map;
 
 public class Ladder {
     private final Players players;
@@ -18,4 +20,19 @@ public Lines getLines() {
     public Players getPlayers() {
         return players;
     }
+
+    public Map<String, String> calculateResults(List<String> results) {
+        Map<String, String> resultMap = new HashMap<>();
+        for (int i = 0; i < players.size(); i++) {
+            String playerName = players.getPlayersNames().get(i);
+            var cursor = i;
+            cursor = lines.calculateLastPosition(cursor);
+            resultMap.put(playerName, results.get(cursor));
+        }
+        return resultMap;
+    }
+
+    public Report report(List<String> results) {
+        return new Report(calculateResults(results));
+    }
 }

src/main/java/nextstep/ladder/Line.java

@@ -1,20 +1,56 @@
 package nextstep.ladder;
 
+import java.util.ArrayList;
 import java.util.List;
 import java.util.Random;
-import java.util.stream.Collectors;
-import java.util.stream.IntStream;
 
 public class Line {
     private final List<Boolean> points;
 
-    public Line(int playerCount, Random random) {
-        this.points = IntStream.range(1, playerCount)
-                .mapToObj(it -> random.nextBoolean())
-                .collect(Collectors.toUnmodifiableList());
+    Line(int playerCount, Random random) {
+        this.points = new ArrayList<>();
+
+        for (int i = 0; i < playerCount - 1; i++) {
+            if (i == 0) {
+                points.add(random.nextBoolean());
+                continue;
+            }
+
+            if (points.get(i - 1) == true) {
+                points.add(false);
+                continue;
+            }
+
+            points.add(random.nextBoolean());
+        }
+    }
+
+    Line(List<Boolean> points) {
+        this.points = points;
     }
 
     public List<Boolean> getPoints() {
         return points;
     }
+
+    public int calculateNextPosition(int cursor) {
+        if (cursor == 0 && points.get(cursor)) {
+            return ++cursor;
+        }
+
+        if (cursor == points.size() && points.get(cursor - 1)) {
+            return --cursor;
+        }
+
+        if (points.get(cursor - 1)) {
+            return --cursor;
+        }
+
+        if (points.get(cursor)) {
+            return ++cursor;
+        }
+
+        return cursor;
+
+    }
 }

src/main/java/nextstep/ladder/Lines.java

@@ -27,4 +27,14 @@ public static Lines of(int height, int playerCount) {
     public List<Line> getLines() {
         return lines;
     }
+
+    public int calculateLastPosition(int playerIndex) {
+        int cursor = playerIndex;
+
+        for (Line line : lines) {
+            cursor = line.calculateNextPosition(cursor);
+        }
+
+        return cursor;
+    }
 }

src/main/java/nextstep/ladder/Players.java

@@ -22,4 +22,8 @@ public List<String> getPlayersNames() {
                 .map(Player::getName)
                 .collect(Collectors.toList());
     }
+
+    public int size() {
+        return players.size();
+    }
 }

src/main/java/nextstep/ladder/Report.java

@@ -0,0 +1,28 @@
+package nextstep.ladder;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class Report {
+    private final Map<String, String> result;
+
+    public Report(Map<String, String> result) {
+        this.result = result;
+    }
+
+    public Map<String, String> getResult() {
+        return new HashMap<>(result);
+    }
+
+    public boolean containsName(String name) {
+        return result.containsKey(name);
+    }
+
+    public String findResultByName(String name) {
+        if (!result.containsKey(name)) {
+            throw new IllegalArgumentException("해당 이름의 결과가 존재하지 않습니다.");
+        }
+
+        return result.get(name);
+    }
+}

src/main/java/nextstep/ui/InputView.java

@@ -15,6 +15,12 @@ public static List<String> inputPlayerNames() {
                 .collect(Collectors.toUnmodifiableList());
     }
 
+    public static List<String> inputResults() {
+        System.out.println("실행 결과를 입력하세요. (결과는 쉼표(,)로 구분하세요)");
+        return Arrays.stream(scanner.nextLine().split(","))
+                .collect(Collectors.toUnmodifiableList());
+    }
+
     public static int inputHeight() {
         System.out.println("최대 사다리 높이는 몇 개인가요?");
         return scanner.nextInt();

src/main/java/nextstep/ui/OutputView.java

@@ -3,15 +3,19 @@
 import nextstep.ladder.Ladder;
 import nextstep.ladder.Lines;
 import nextstep.ladder.Players;
+import nextstep.ladder.Report;
 
+import java.util.List;
+import java.util.Scanner;
 import java.util.stream.Collectors;
 
 public class OutputView {
 
-    public static void printResult(Ladder ladder) {
+    public static void printResult(Ladder ladder, List<String> results) {
         System.out.println("실행 결과");
         printPlayer(ladder.getPlayers());
         printLine(ladder.getLines());
+        printResults(results);
     }
 
     private static void printPlayer(Players players) {
@@ -27,4 +31,30 @@ private static void printLine(Lines lines) {
             System.out.println(lineString);
         });
     }
+
+    private static void printResults(List<String> results) {
+        System.out.println(String.join("  ", results));
+    }
+
+    public static void searchResult(Report report) {
+        while (true) {
+            System.out.println("결과를 보고 싶은 사람은? (종료하려면 'exit' 입력)");
+            Scanner scanner = new Scanner(System.in);
+            String input = scanner.nextLine();
+
+            if (input.equalsIgnoreCase("exit")) {
+                break;
+            }
+
+            if ("all".equalsIgnoreCase(input)) {
+                System.out.println("실행 결과");
+                report.getResult().forEach((key, value) -> System.out.println(key + " : " + value));
+            } else if (report.containsName(input)) {
+                System.out.println("실행 결과");
+                System.out.println(report.findResultByName(input));
+            } else {
+                System.out.println("존재하지 않는 이름입니다. 다시 입력해주세요.");
+            }
+        }
+    }
 }

src/test/java/nextstep/ladder/LineTest.java

@@ -4,19 +4,20 @@
 import org.junit.jupiter.api.DisplayName;
 import org.junit.jupiter.api.Test;
 
+import java.util.List;
 import java.util.Random;
 
+import static org.assertj.core.api.Assertions.assertThat;
+
 public class LineTest {
 
     @Test
-    @DisplayName("사다리 라인 생성 테스트")
+    @DisplayName("사다리 라인 생성 테스트: 길이 양쪽에 생길 수 없다.")
     void createTest() {
         var playerCount = 5;
         var trueLine = new Line(playerCount, new TrueRandom());
-        var falseLine = new Line(playerCount, new FalseRandom());
 
-        Assertions.assertThat(trueLine.getPoints()).containsExactly(true, true, true, true);
-        Assertions.assertThat(falseLine.getPoints()).containsExactly(false, false, false, false);
+        Assertions.assertThat(trueLine.getPoints()).isEqualTo(List.of(true, false, true, false));
     }
 
     static class TrueRandom extends Random {
@@ -26,10 +27,73 @@ public boolean nextBoolean() {
         }
     }
 
-    static class FalseRandom extends Random {
-        @Override
-        public boolean nextBoolean() {
-            return false;
-        }
+    @Test
+    @DisplayName("cursor가 0일 때 오른쪽으로 이동")
+    void calculateNextPosition_cursorAtStart_movesRight() {
+        // given
+        var points = List.of(true, false, false);
+        var line = new Line(points);
+
+        // when
+        int nextPosition = line.calculateNextPosition(0);
+
+        // then
+        assertThat(nextPosition).isEqualTo(1);
+    }
+
+    @Test
+    @DisplayName("cursor가 마지막 위치일 때 왼쪽으로 이동")
+    void calculateNextPosition_cursorAtEnd_movesLeft() {
+        // given
+        var points = List.of(false, false, true);
+        var line = new Line(points);
+
+        // when
+        int nextPosition = line.calculateNextPosition(2);
+
+        // then
+        assertThat(nextPosition).isEqualTo(1);
+    }
+
+    @Test
+    @DisplayName("cursor가 중간에 있을 때 왼쪽으로 이동")
+    void calculateNextPosition_cursorInMiddle_movesLeft() {
+        // given
+        var points = List.of(false, true, false);
+        var line = new Line(points);
+
+        // when
+        int nextPosition = line.calculateNextPosition(2);
+
+        // then
+        assertThat(nextPosition).isEqualTo(1);
+    }
+
+    @Test
+    @DisplayName("cursor가 중간에 있을 때 오른쪽으로 이동")
+    void calculateNextPosition_cursorInMiddle_movesRight() {
+        // given
+        var points = List.of(false, false, true);
+        var line = new Line(points);
+
+        // when
+        int nextPosition = line.calculateNextPosition(1);
+
+        // then
+        assertThat(nextPosition).isEqualTo(2);
+    }
+
+    @Test
+    @DisplayName("cursor가 이동하지 않음")
+    void calculateNextPosition_cursorDoesNotMove() {
+        // given
+        var points = List.of(false, false, false);
+        var line = new Line(points);
+
+        // when
+        int nextPosition = line.calculateNextPosition(1);
+
+        // then
+        assertThat(nextPosition).isEqualTo(1);
     }
 }

src/test/java/nextstep/ladder/LinesTest.java

@@ -1,5 +1,6 @@
 package nextstep.ladder;
 
+import org.assertj.core.api.Assertions;
 import org.junit.jupiter.api.DisplayName;
 import org.junit.jupiter.api.Test;
 
@@ -14,6 +15,7 @@ void createTest() {
     @Test
     @DisplayName("lines 생성할때 1보다 작은 값이 들어오면 예외 발생")
     void createExceptionTest() {
-        Lines.of(0,3);
+        Assertions.assertThatThrownBy(() -> Lines.of(0, 3))
+                .isInstanceOf(IllegalArgumentException.class).hasMessage("높이는 1 이상이어야 합니다.");
     }
 }