Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
19 changes: 19 additions & 0 deletions README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
#사다리게임

##1단계
- 4X4 크기의 사다리를 출력한다.
- 가로라인이 겹치지 않게 랜덤으로 줄을 긋는다.

##2단계
-사다리 넓이와 높이를 입력받아, 그 크기의 사다리를 출력한다.

##3단계
-0부터 인덱스 번호를 부여해 사다리 타고 난 후 결과를 출력하낟.

##4단계
-사다리 게임에 참여하는 사람에 이름을 최대 5글자까지 부여할 수 있다. 사다리를 출력할 때 사람 이름도 같이 출력한다.
사람 이름은 쉼표(,)를 기준으로 구분한다.
-개인별 이름을 입력하면 개인별 결과를 출력하고, "all"을 입력하면 전체 참여자의 실행 결과를 출력한다.

##5단계
-리팩토링
1 change: 1 addition & 0 deletions build.gradle
Original file line number Diff line number Diff line change
@@ -1,5 +1,6 @@
plugins {
id 'java'
id 'application'
}

group = 'cholog'
Expand Down
7 changes: 7 additions & 0 deletions src/main/java/Main.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,7 @@
import controller.LadderController;

public class Main {
public static void main(String[] args) {
new LadderController().run();
}
}
75 changes: 75 additions & 0 deletions src/main/java/controller/LadderController.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,75 @@
package controller;

import model.Ladder;
import model.LadderSize;
import model.Line;
import model.LadderFactory;
import model.LadderGame;
import model.BuildLine;
import view.InputView;
import view.OutputView;

import java.util.ArrayList;
import java.util.List;

public class LadderController {
private final LadderFactory factory = new LadderFactory();
private final OutputView outputView = new OutputView();
private final InputView inputView = new InputView();

public void run() {

List<String> participants = inputView.inputParticipants();
int width = participants.size();

List<String> results;
while (true) {
results = inputView.inputResults();
if (participants.size() == results.size()) {
break;
}
outputView.printError("참여자 수와 결과 수가 일치하지 않습니다.");
}

int height;
while (true) {
height = inputView.heightSize();
if (height >= 1) {
break;
}
outputView.printError("높이는 1이상이어야 합니다.");
}

LadderSize size = new LadderSize(width, height);
Ladder ladder = factory.create(size, width);

List<String> lines = new ArrayList<>();
for (Line line : ladder.lines()) {
lines.add(BuildLine.build(line));
}

outputView.printLadder(participants, lines, results);

LadderGame game = new LadderGame(ladder, participants.size());
playGame(game, participants, results);
}

private void playGame(LadderGame game, List<String> participants, List<String> results) {
while (true) {
String queryName = inputView.inputQueryName();

if ("all".equals(queryName)) {
outputView.printAllResults(game.playAll(participants, results));
break;
}

if (!participants.contains(queryName)) {
outputView.printError("존재하지 않는 이름입니다.");
continue;
}

String result = game.getResult(queryName, participants, results);
outputView.printSingleResult(queryName, result);
}
}
}
20 changes: 20 additions & 0 deletions src/main/java/model/BuildLine.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
package model;

import java.util.Objects;

public final class BuildLine {

public static final int LADDER_LINE = 5;

public static String build(Line line) {
Objects.requireNonNull(line);
StringBuilder b = new StringBuilder();
for (Point p : line.points()) {
b.append("|");
String fill = p.isConnected() ? "-".repeat(LADDER_LINE) : " ".repeat(LADDER_LINE);
b.append(fill);
}
b.append("|");
return b.toString();
}
}
17 changes: 17 additions & 0 deletions src/main/java/model/Ladder.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
package model;

import java.util.List;
import java.util.Objects;

public class Ladder {
private final List<Line> lines;

public Ladder(List<Line> lines) {
this.lines = Objects.requireNonNull(lines);
}

public List<Line> lines() {
return lines;
}
}

33 changes: 33 additions & 0 deletions src/main/java/model/LadderFactory.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
package model;

import java.util.ArrayList;
import java.util.List;
import java.util.Random;

public class LadderFactory {
private final Random random = new Random();

public Ladder create(LadderSize size, int width) {
List<Line> lines = new ArrayList<>();
for (int i = 0; i < size.height(); i++) {
lines.add(createLine(width));
}
return new Ladder(lines);
}

private Line createLine(int width) {
int pointsCount = width - 1;
List<Point> points = new ArrayList<>();
boolean prevConnected = false;

for (int i = 0; i < pointsCount; i++) {
boolean connect = false;
if (!prevConnected) {
connect = random.nextBoolean();
}
points.add(new Point(connect));
prevConnected = connect;
}
return new Line(points);
}
}
55 changes: 55 additions & 0 deletions src/main/java/model/LadderGame.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,55 @@
package model;

import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;

public class LadderGame {
private final Ladder ladder;
private final int positions;

public LadderGame(Ladder ladder, int width) {
this.ladder = ladder;
this.positions = width;
}

public Map<String, String> playAll(List<String> participants, List<String> results) {
Map<String, String> allResults = new LinkedHashMap<>();
for (int i = 0; i < participants.size(); i++) {
int finalPosition = play(i);
allResults.put(participants.get(i), results.get(finalPosition));
}
return allResults;
}

public String getResult(String name, List<String> participants, List<String> results) {
int startIndex = participants.indexOf(name);
int finalPosition = play(startIndex);
return results.get(finalPosition);
}

public int play(int startPosition) {
int currentPosition = startPosition;
List<Line> lines = ladder.lines();

for (Line line : lines) {
currentPosition = moveOnLine(currentPosition, line);
}

return currentPosition;
}

private int moveOnLine(int position, Line line) {
List<Point> points = line.points();

if (position > 0 && points.get(position - 1).isConnected()) {
return position - 1;
}

if (position < points.size() && points.get(position).isConnected()) {
return position + 1;
}

return position;
}
}
15 changes: 15 additions & 0 deletions src/main/java/model/LadderSize.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
package model;

public class LadderSize {
private final int height;
private final int width;

public LadderSize(int width, int height) {
this.height = height;
this.width = width;
}

public int height() {
return height;
}
}
16 changes: 16 additions & 0 deletions src/main/java/model/Line.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
package model;

import java.util.List;
import java.util.Objects;

public class Line {
private final List<Point> points;

public Line(List<Point> points) {
this.points = Objects.requireNonNull(points);
}

public List<Point> points() {
return points;
}
}
13 changes: 13 additions & 0 deletions src/main/java/model/Point.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
package model;

public class Point {
private final boolean connected;

public Point(boolean connected) {
this.connected = connected;
}

public boolean isConnected() {
return connected;
}
}
34 changes: 34 additions & 0 deletions src/main/java/view/InputView.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,34 @@
package view;

import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

public class InputView {
Scanner scanner = new Scanner(System.in);

public List<String> inputParticipants() {
System.out.println("참여할 사람 이름을 입력하세요. (이름은 쉼표(,)로 구분하세요)");
String input = scanner.nextLine();
return Arrays.asList(input.split(","));
}

public List<String> inputResults() {
System.out.println("실행 결과를 입력하세요. (결과는 쉼표(,)로 구분하세요)");
String input = scanner.nextLine();
return Arrays.asList(input.split(","));
}

public int heightSize() {
System.out.println("최대 사다리 높이는 몇 개인가요?");
int height = scanner.nextInt();
scanner.nextLine();
return height;
}

public String inputQueryName() {
System.out.println();
System.out.println("결과를 보고 싶은 사람은?");
return scanner.nextLine();
}
}
43 changes: 43 additions & 0 deletions src/main/java/view/OutputView.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,43 @@
package view;

import java.util.List;
import java.util.Map;

public class OutputView {
public void printLadder(List<String> participants, List<String> lines, List<String> results) {
System.out.println();
System.out.println("실행결과");

for (String name : participants) {
System.out.print(String.format("%-5s", name));
}
System.out.println();

for (String line : lines) {
System.out.println(line);
}

for (String result : results) {
System.out.print(String.format("%-5s", result));
}
System.out.println();
}

public void printSingleResult(String name, String result) {
System.out.println();
System.out.println("실행결과");
System.out.println(result);
}

public void printAllResults(Map<String, String> results) {
System.out.println();
System.out.println("실행결과");
for (Map.Entry<String, String> entry : results.entrySet()) {
System.out.println(entry.getKey() + " : " + entry.getValue());
}
}

public void printError(String message) {
System.out.println(message);
}
}
Loading