Be/main/jongmlee java lv2

v1/backend/JAVA_LV_2_알고리즘의_굴레/src/main/java/com/example/algorithmbot/BFS.java

@@ -2,4 +2,13 @@
 
 public class BFS implements Algorithm {
 
+	@Override
+	public boolean isSolution(Algorithm algorithm) {
+		return algorithm instanceof BFS;
+	}
+
+	@Override
+	public String getSolution() {
+		return "주변부터 둘러보기";
+	}
 }

v1/backend/JAVA_LV_2_알고리즘의_굴레/src/main/java/com/example/algorithmbot/BinarySearch.java

@@ -2,4 +2,13 @@
 
 public class BinarySearch implements Algorithm {
 
+	@Override
+	public boolean isSolution(Algorithm algorithm) {
+		return algorithm instanceof BinarySearch;
+	}
+
+	@Override
+	public String getSolution() {
+		return "반띵 ㄱㄱ";
+	}
 }

v1/backend/JAVA_LV_2_알고리즘의_굴레/src/main/java/com/example/algorithmbot/DFS.java

@@ -2,4 +2,13 @@
 
 public class DFS implements Algorithm {
 
+	@Override
+	public boolean isSolution(Algorithm algorithm) {
+		return algorithm instanceof DFS;
+	}
+
+	@Override
+	public String getSolution() {
+		return "나는 한 놈씩 조져";
+	}
 }

v1/backend/JAVA_LV_2_알고리즘의_굴레/src/main/java/com/example/algorithmbot/DP.java

@@ -2,4 +2,13 @@
 
 public class DP implements Algorithm {
 
+	@Override
+	public boolean isSolution(Algorithm algorithm) {
+		return algorithm instanceof DP;
+	}
+
+	@Override
+	public String getSolution() {
+		return "누가 첫날부터 DP문제를 들고옵니까";
+	}
 }

v1/backend/JAVA_LV_2_알고리즘의_굴레/src/main/java/com/example/algorithmbot/Main.java

@@ -1,8 +1,29 @@
 package com.example.algorithmbot;
 
+import java.util.List;
+
 public class Main {
 
 	public static void main(String[] args) {
+		Wchae wchae = new Wchae();
+		List<Algorithm> algorithmList = List.of(new BFS(), new DFS(), new TwoPointer(),
+				new BinarySearch(), new DP());
+
+		for (int i = 0; i < 20; i++) {
+			Algorithm first = algorithmList.get((int) (Math.random() * 5));
+			Algorithm second = algorithmList.get((int) (Math.random() * 5));
+			printTodaysAlgorithm(first, second);
+			printWchaeSolveResult(wchae.solveAlgorithm(first), wchae.solveAlgorithm(second));
+			System.out.println();
+		}
+	}
+
+	public static void printTodaysAlgorithm(Algorithm first, Algorithm second) {
+		System.out.printf("오늘의 알고리즘 : %s, %s\n", first.getClass().getSimpleName(),
+				second.getClass().getSimpleName());
+	}
 
+	public static void printWchaeSolveResult(String firstResult, String secondResult) {
+		System.out.printf("우주 : %s / %s\n", firstResult, secondResult);
 	}
 }

v1/backend/JAVA_LV_2_알고리즘의_굴레/src/main/java/com/example/algorithmbot/TwoPointer.java

@@ -2,4 +2,13 @@
 
 public class TwoPointer implements Algorithm {
 
+	@Override
+	public boolean isSolution(Algorithm algorithm) {
+		return algorithm instanceof TwoPointer;
+	}
+
+	@Override
+	public String getSolution() {
+		return "너에게 닿기를...";
+	}
 }

v1/backend/JAVA_LV_2_알고리즘의_굴레/src/main/java/com/example/algorithmbot/Wchae.java

@@ -1,5 +1,35 @@
 package com.example.algorithmbot;
 
+import java.util.HashMap;
+import java.util.Map;
+
 public class Wchae {
 
+	private final Map<Algorithm, Integer> algorithmMap;
+
+	public Wchae() {
+		algorithmMap = new HashMap<>();
+	}
+
+	public String solveAlgorithm(Algorithm algorithm) {
+		Integer solveCount = algorithmMap.getOrDefault(algorithm, 0);
+		// 풀어보지 못한 알고리즘인 경우
+		boolean isSolvedAlgorithm = algorithmMap.keySet()
+				.stream()
+				.filter(x -> x.isSolution(algorithm))
+				.findAny().isPresent();
+		if (!isSolvedAlgorithm) {
+			algorithmMap.put(algorithm, 1);
+			return "스트레스 받네...";
+		}
+		// 풀어본 알고리즘인 경우
+		boolean isSolved = Math.random() * 10 > solveCount;
+		if (isSolved) {
+			if (solveCount < 10) {
+				algorithmMap.put(algorithm, solveCount + 1);
+			}
+			return algorithm.getSolution();
+		}
+		return "스트레스 받네...";
+	}
 }