📖 문제 📃 코드 import math # fees = [120, 0, 60, 591] # records = ["16:00 3961 IN","16:00 0202 IN","18:00 3961 OUT","18:00 0202 OUT","23:58 3961 IN"] # result = [0, 591] def solution(fees, records): answer = [] inTime = [0] * 10000 isIn = [0] * 10000 sumT = [0] * 10000 for record in records: a, b, c = record.split() H, M = a.split(":") if c == "IN": # record for initTime -> inTime[3961] = H*60 + M in..

📖 문제 📃 코드 import collections # id_list = ["muzi", "frodo", "apeach", "neo"] # report = ["muzi frodo", "apeach frodo", "frodo neo", "muzi neo", "apeach muzi"] # k = 2 def solution(id_list, report, k): answer = [] # remove repeated report report = list(set(report)) # prevent duplicated reported user name reportHash = collections.defaultdict(set) # counting how many reported user stopped = collecti..

📖 문제 플로이드 와샬 알고리즘을 직접 만들어보시오 📃 코드 public class Main { static int INF = 1000000; public static void main(String[] args) { int[][] dp = { { 0, 8, 1, INF }, { INF, 0, INF, 1 }, { INF, 2, 0, 9 }, { 4, INF, INF, 0 } }; DP(dp); } private static void DP(int[][] dp) { // result array int result[][] = new int[4][4]; // init for (int i = 0; i < 4; i++) { for (int j = 0; j < 4; j++) { result[i][j] = dp[i][..