LV1, LV2

v1/backend/JAVA_LV_0_잼민_펀치/src/main/java/com/example/maddaewoole/Daewoole.java

@@ -1,5 +1,24 @@
 package com.example.maddaewoole;
 
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
 public class Daewoole {
+	public int now_anger = 0;
+	public int anger_threshold;
+	public Map<String, Integer> anger_map = new HashMap<>();
 
-}
+	public int getAnger_threshold() {
+		return anger_threshold;
+	}
+	Daewoole(List<String> str){
+		anger_threshold = (int) ((Math.random() * 40) + 80);
+		anger_map.put(str.get(0), (int)(Math.random() * 10000) % 20);
+		anger_map.put(str.get(1), (int)(Math.random() * 20) + 10);
+		anger_map.put(str.get(2), (int)(Math.random() * 20) + 30);
+	}
+	int beProvinced(String str){
+		return anger_map.get(str);
+	}
+}

v1/backend/JAVA_LV_0_잼민_펀치/src/main/java/com/example/maddaewoole/Jpark2.java

@@ -1,5 +1,17 @@
 package com.example.maddaewoole;
 
+
+import java.util.List;
+
 public class Jpark2 {
+	private List<String> str = List.of("'당신의 지각비, 회식비로 대체되었다'", "'코딩 그렇게 하는 거 아닌데'", "'오늘 저녁은 감탄계'");
+
+	String prov(){
+		int random_num = (int) ((Math.random()*10000)%3);
+		return str.get(random_num);
+	}
 
+	public List<String> getStr() {
+		return str;
+	}
 }

v1/backend/JAVA_LV_0_잼민_펀치/src/main/java/com/example/maddaewoole/Main.java

@@ -3,6 +3,21 @@
 public class Main {
 
 	public static void main(String[] args) {
+		Jpark2 jiwon = new Jpark2();
+		Daewoole daewook = new Daewoole(jiwon.getStr());
 
+		int attack_cnt = 0;
+		while (true) {
+			String attack = jiwon.prov();
+			int daewookAnger = daewook.beProvinced(attack);
+			System.out.println("지원은 " + attack + "를 시전하여 대욱의 분노를 " + daewookAnger + " 증가시켰다.");
+			daewook.now_anger += daewookAnger;
+			System.out.println("현재 대욱의 분노 수치 : " + daewook.now_anger);
+			if (daewook.now_anger > daewook.getAnger_threshold()) {
+				break;
+			}
+			attack_cnt++;
+		}
+		System.out.println("대욱을 도발한 횟수 : " + attack_cnt + "회");
 	}
 }

v1/backend/JAVA_LV_1_알바의_달인/src/main/java/com/example/bot/BotImpl.java

@@ -1,14 +1,88 @@
 package com.example.bot;
 
+import java.util.HashMap;
+import java.util.Map;
+
+
 public class BotImpl implements JiwonBehavior {
 
+	private final Map<String, Integer> product = new HashMap<>();
+
 	@Override
 	public void takeOrder(String order) {
+		if (order.equals("얼마야?")) {
+			result();
+			return;
+		}
+		int loc = order.indexOf('>');
+		String name = order.substring(1, loc);
+		order = order.substring(loc + 1);
+
+		if (order.equals("빼")) {
+			outProduct(name);
+		} else if (order.equals("시켰나?")) {
+			didIOrdered(name);
+		} else if (order.equals("몇 개야?")) {
+			howManyOrdered(name);
+		} else {
+			orderProducts(order, name);
+		}
+	}
+
+	private void orderProducts(String order, String name) {
+		int price = name.length() * 1000;
+		if (product.containsKey(name)) {
+			product.put(name, product.get(name) + 1);
+		} else {
+			product.put(name, 1);
+		}
+
+		if (order.indexOf('랑') >= 0) {
+			int loc = order.indexOf('<');
+			name = order.substring(loc + 1, order.length() - 1);
+			price += name.length() * 1000;
+			if (product.containsKey(name)) {
+				product.put(name, product.get(name) + 1);
+			} else {
+				product.put(name, 1);
+			}
+
+		}
+		System.out.println("네 " + price + "원이요");
+	}
+
+	private void outProduct(String name) {
+		if (product.containsKey(name)) {
+			product.remove(name);
+			System.out.println("네");
+		} else {
+			System.out.println("<" + name + ">안 시키셨어요");
+		}
+	}
+
+	private void didIOrdered(String name) {
+		if (product.containsKey(name)) {
+			System.out.println("<" + name + ">시키셨어요");
+		} else {
+			System.out.println("<" + name + ">안 시키셨어요");
+		}
+	}
 
+	private void howManyOrdered(String name) {
+		if (product.containsKey(name)) {
+			System.out.println("<" + name + ">" + product.get(name) + "개요");
+		} else {
+			System.out.println("<" + name + ">안 시키셨어요");
+		}
 	}
 
 	@Override
 	public void result() {
+		int total = 0;
+		for (String key : product.keySet()) {
+			total += key.length() * 1000 * product.get(key);
+		}
+		System.out.println("총 " + total + "원 입니다");
 
 	}
 }

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

@@ -2,4 +2,15 @@
 
 public class BFS implements Algorithm {
 
+	boolean isSolved = false;
+
+	@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,12 @@
 
 public class BinarySearch implements Algorithm {
 
+	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,12 @@
 
 public class DFS implements Algorithm {
 
+	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,12 @@
 
 public class DP implements Algorithm {
 
+	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,38 @@
 package com.example.algorithmbot;
 
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
 public class Main {
 
 	public static void main(String[] args) {
+		BFS bfs = new BFS();
+		DFS dfs = new DFS();
+		TwoPointer twoPointer = new TwoPointer();
+		BinarySearch binarySearch = new BinarySearch();
+		DP dp = new DP();
+
+		List<Algorithm> algorithm = new ArrayList<>(
+				Arrays.asList(bfs, dfs, twoPointer, binarySearch, dp));
+		List<String> todayAlgorithm = new ArrayList<>(
+				Arrays.asList("BFS", "DFS", "TwoPointer", "BinaraySearch", "DP"));
+
+		Wchae wchae = new Wchae();
+
+		for (int i = 0; i < 20; i++) {
+			int today1 = (int) ((Math.random() * 10) % 5);
+			int today2 = (int) ((Math.random() * 10) % 5);
+
+			Algorithm todayAlgorithm1 = algorithm.get(today1);
+			Algorithm todayAlgorithm2 = algorithm.get(today2);
+
+			System.out.println(
+					"오늘의 알고리즘 : " + todayAlgorithm.get(today1) + ", " + todayAlgorithm.get(today2));
+			System.out.println(
+					"우주 : " + wchae.solveAlgorithm(todayAlgorithm1) + " / " + wchae.solveAlgorithm(
+							todayAlgorithm2));
+		}
 
 	}
 }

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

@@ -2,4 +2,12 @@
 
 public class TwoPointer implements Algorithm {
 
+	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,30 @@
 package com.example.algorithmbot;
 
+import java.util.HashMap;
+import java.util.Map;
+import java.util.Optional;
+
 public class Wchae {
 
+	private final Map<Algorithm, Integer> algorithmMap = new HashMap<>();
+
+	public String solveAlgorithm(Algorithm haveToSolve) {
+		Optional<Algorithm> today1 = algorithmMap.keySet().stream()
+				.filter(x -> x.isSolution(haveToSolve)).findFirst();
+
+		if (today1.isPresent()) {
+			int solved_cnt = algorithmMap.getOrDefault(haveToSolve, 0);
+			algorithmMap.put(haveToSolve, solved_cnt + 1);
+			double percentage = Math.random();
+			if ((double) solved_cnt * 0.1 > percentage) {
+				return haveToSolve.getSolution();
+			} else {
+				return "스트레스 받네...";
+			}
+		} else {
+			algorithmMap.put(haveToSolve, 1);
+			return "스트레스 받네...";
+		}
+	}
+
 }