삽집하는 개발들/알고리즘

[6일차] [프로그래머스] [2022 카카오 - 92334]신고 결과 받기

악투 2023. 6. 12. 16:21
반응형
def solution(id_list, report, k):
	id_dict = {}
	declaration_arr = []
	declaration_list = {}
	repost_dict = {}

	for data in id_list:
			id_dict[data] = 0
			repost_dict[data] = 0
			declaration_list[data] = []

	for data in report:
			declaration = data.split(' ')          
			if declaration[1] not in declaration_list[declaration[0]]:      
					id_dict[declaration[1]] = int(id_dict.get(declaration[1])) + 1
					declaration_list[declaration[0]].append(declaration[1])

	for data in id_dict.items():
			if data[1] >= k:
					declaration_arr.append(data[0])
			else:
					declaration_arr.append(0)

	for data in declaration_list.items():
			for val in set(data[1]):
					if val in declaration_arr:
							repost_dict[data[0]] = int(repost_dict[data[0]]) + 1

	return list(repost_dict.values())
반응형