Kakao4 [python] 15953. 상금 헌터 문제 출처 15953. 상금 헌터 풀이 first = [0]*101 second = [0]*65 for i in range(101): if i == 0: continue elif i < 2: first[i] = 500 elif i < 4: first[i] = 300 elif i < 7: first[i] = 200 elif i < 11: first[i] = 50 elif i < 16: first[i] = 30 elif i < 22: first[i] = 10 else: break for i in range(65): if i == 0: continue elif i < 2: second[i] = 512 elif i < 4: second[i] = 256 elif i < 8: second[i] = 128 elif .. 2019. 10. 22. [python] 문자열 압축 문제 출처 문자열 압축 풀이 def solution(s): answer = len(s) for i in range(1, len(s)//2+1): result, unit, cnt = '', s[:i], 1 for j in range(i, len(s), i): if s[j:j+i] == unit: cnt += 1 else: result += str(cnt)+unit if cnt > 1 else unit unit = s[j:j+i] cnt = 1 result += str(cnt)+unit if cnt > 1 else unit answer = min(answer, len(result)) return answer 2019. 10. 6. [python] 추석 트래픽 문제 출처 추석 트래픽 풀이 def solution(lines): logs = [] for line in lines: _, done, time = line.split() h, m, s = done.split(':') end = (int(h)*60*60 + int(m)*60 + float(s))*1000 logs.append((end-float(time[:-1])*1000+1, end)) length = len(logs) max_ = 1 for i in range(length-1): cnt = 1 for j in range(i+1, length): if logs[j][1] - logs[i][1] >= 4000: break if logs[j][0] - logs[i][1] < 1000: cnt .. 2019. 9. 3. [python] 무지의 먹방 라이브 문제 출처 무지의 먹방 라이브 풀이 def solution(food_times, k): times = {} for idx, time in enumerate(food_times): if time in times: times[time].append(idx) else: times[time] = [idx] len_foods = len(food_times) cycle = 0 for time in sorted(times): if k - (len_foods*(time-cycle)) >= 0: k -= len_foods*(time-cycle) len_foods -= len(times[time]) cycle += time-cycle else: k %= len_foods for i in times: if i >= time.. 2019. 9. 3. 이전 1 다음
