2-6 위장

week2/2. 올바른 괄호/Solution.java

@@ -2,6 +2,37 @@
     2. 올바른 괄호
     https://programmers.co.kr/learn/courses/30/lessons/12909
 */
-public class Solution {
+import java.util.HashMap;
+import java.util.Map;
 
+public class Solution2_6 {
+	public static void main(String[] args) {
+		String[][] clothes = { { "yellow_hat", "headgear" }, { "blue_sunglasses", "eyewear" },
+				{ "green_turban", "headgear" } };
+
+		System.out.println(solution(clothes));
+	}
+
+	public static int solution(String[][] clothes) {
+		int answer = 1;
+
+		Map<String, Integer> cloteshMap = new HashMap<>();
+
+		for (String[] cloth : clothes) {
+
+			cloteshMap.put(cloth[1], cloteshMap.getOrDefault(cloth[1], 0) + 1);
+
+		}
+
+		for (Map.Entry<String, Integer> cloth : cloteshMap.entrySet()) {
+
+			answer *= (cloth.getValue() + 1);
+
+		}
+
+		answer--;
+
+		return answer;
+
+	}
 }

week2/5. 다리를 지나는 트럭/Solution2_5.java

@@ -0,0 +1,59 @@
+import java.util.*;
+
+/*
+    5. 다리를 지나는 트럭
+    https://programmers.co.kr/learn/courses/30/lessons/42583
+*/
+public class Solution2_5 {
+
+    public static void main(String[] args) {
+
+        int bridge_weight = 100;
+        int bridge_length = 100;
+        int[] truck_weights = { 10 };
+
+        System.out.println(solution(bridge_length, bridge_weight, truck_weights));
+    }
+
+    public static int solution(int bridge_length, int weight, int[] truck_weights) {
+        Queue<Truck> waiting = new LinkedList<>();
+        Queue<Truck> bridge = new LinkedList<>();
+
+        for (int i = 0; i < truck_weights.length; ++i) {
+            waiting.offer(new Truck(truck_weights[i], 0));
+        }
+
+        int time = 0;
+        int totalWeight = 0;
+        while (!waiting.isEmpty() || !bridge.isEmpty()) {
+            time++;
+            if (!bridge.isEmpty()) {
+                Truck t = bridge.peek();
+                if (time - t.entry >= bridge_length) {
+                    totalWeight -= t.weight;
+                    bridge.poll();
+                }
+            }
+
+            if (!waiting.isEmpty()) {
+                if (totalWeight + waiting.peek().weight <= weight) {
+                    Truck t = waiting.poll();
+                    totalWeight += t.weight;
+
+                    bridge.offer(new Truck(t.weight, time));
+                }
+            }
+        }
+        return time;
+    }
+}
+
+class Truck {
+    int weight;
+    int entry;
+
+    Truck(int weight, int entry) {
+        this.weight = weight;
+        this.entry = entry;
+    }
+}

week2/6. 위장/Solution2_6.java

@@ -0,0 +1,38 @@
+/*
+     6. 위장
+    https://programmers.co.kr/learn/courses/30/lessons/42578
+*/
+import java.util.HashMap;
+import java.util.Map;
+
+public class Solution2_6 {
+	public static void main(String[] args) {
+		String[][] clothes = { { "yellow_hat", "headgear" }, { "blue_sunglasses", "eyewear" },
+				{ "green_turban", "headgear" } };
+
+		System.out.println(solution(clothes));
+	}
+
+	public static int solution(String[][] clothes) {
+		int answer = 1;
+
+		Map<String, Integer> cloteshMap = new HashMap<>();
+
+		for (String[] cloth : clothes) {
+
+			cloteshMap.put(cloth[1], cloteshMap.getOrDefault(cloth[1], 0) + 1);
+
+		}
+
+		for (Map.Entry<String, Integer> cloth : cloteshMap.entrySet()) {
+
+			answer *= (cloth.getValue() + 1);
+
+		}
+
+		answer--;
+
+		return answer;
+
+	}
+}