알고리즘 기초/해시(Hash)6

• 배부른 마라노터 import sys from collections import defaultdict dict = defaultdict(int) candidate = int(sys.stdin.readline()) total = candidate + (candidate - 1) for i in range(total): name = sys.stdin.readline() dict[name] += 1 for key in dict: value = dict[key] if value == 1: print(key, end = "") 알고리즘 기초/해시(Hash) 2023. 7. 14.

• 백준_듣보잡 import sys from collections import defaultdict sys.stdin = open("input.txt","rt") cnt = 0 x,y = map(int, input().split()) dict = defaultdict(int) tmp_list = [] for k in range(x+y): name = input() dict[name] += 1 for key in sorted(dict): value = dict[key] if value == 2: tmp_list.append(key) print(len(tmp_list)) for x in tmp_list: print(x) 알고리즘 기초/해시(Hash) 2023. 7. 10.

• 두수의 합 O(n) nums = [7,3,2,13,9,15,8,11] target = 12 def solution(nums, target): answer = [0,0] from collections import defaultdict dict = defaultdict(int) for i in range(len(nums)): dict[nums[i]] = 1 y = nums[i] x = target - y if x in dict: dict[x] += 1 if dict[x] == 2: return sorted([nums[i],x]) break print(solution(nums, target)) 알고리즘 기초/해시(Hash) 2023. 7. 9.

• 팰린드롬 확인 string = "abacbaa" def solution(string): # 팰린드롬 from collections import defaultdict str_list = list(string) unique_str = set(str_list) dict = defaultdict(int) for x in unique_str: for y in str_list: if x == y: dict[x] += 1 print(dict) print(solution("abacbaa")) # print(solution("abaaceeffkckbaa")) # print(solution("abcabbcc")) # print(solution("sgsgsgabaaaecececekefefkccckbsgaaffsgsg")) # print(.. 알고리즘 기초/해시(Hash) 2023. 7. 7.

• 빈도수 DictDefault Use from collections import defaultdict nums = [3,3,3] def solution(nums): answer = -1 # int 는 value 값 지정 dict = defaultdict(int) for x in nums: dict[x] += 1 for key in dict: value = dict[key] if value == 1: answer = max(answer,key) return answer print(solution(nums)) 알고리즘 기초/해시(Hash) 2023. 7. 6.

• 빈도수 nums = [1,1,3,6,6,6] def Solution(nums): dict = {} for i in range(1,100): dict[i] = 0 for k in nums: dict[k] += 1 # 빈도수 뽑아내기 min_val = -1970000 for val in dict.values(): if val >= 1: if val > min_val: min_val = val if min_val >= 1: return min_val else: return -1 print(Solution(nums)) 알고리즘 기초/해시(Hash) 2023. 7. 5.