폰켓몬
링크텍스트
def solution(nums):
choose = int(len(nums) / 2)
nums = set(nums)
answer = min(len(nums), choose)
return answer
완주하지 못한 선수
링크텍스트
def solution(participant, completion):
d = {}
for x in participant:
d[x] = d.get(x, 0) + 1
for x in completion:
d[x] -= 1
dnf = [k for k, v in d.items() if v > 0]
answer = dnf[0]
return answer
def solution(participant, completion):
answer = ''
participant.sort()
completion.sort()
for i in range(len(completion)):
if(participant[i] != completion[i]): return participant[i]
return participant[len(participant)-1]
전화번호 목록
링크텍스트
def solution(phone_book):
answer = True
hash_map = {}
for phone_number in phone_book:
hash_map[phone_number] = 1
for phone_number in phone_book:
temp = ""
for number in phone_number:
temp += number
if temp in hash_map and temp != phone_number:
answer = False
print(hash_map)
return answer
def solution(phone_book):
answer = True
hash_map = {}
for phone_number in phone_book:
temp = ""
for number in phone_number:
temp += number
if temp in phone_book and temp != phone_number:
answer = False
return answer
위장
링크텍스트
def solution(clothes):
answer = 1
dic = {}
for i in range(len(clothes)):
kind = clothes[i][1]
if kind in dic:
dic[kind] += 1
else:
dic[kind] = 1
for k in dic.keys():
print(k)
answer *= (dic[k]+1)
answer -= 1
return answer
베스트앨범
링크텍스트
def solution(genres, plays):
answer = []
dic1 = {}
dic2 = {}
for i, (g, p) in enumerate(zip(genres, plays)):
if g not in dic1:
dic1[g] = [(i, p)]
else:
dic1[g].append((i, p))
if g not in dic2:
dic2[g] = p
else:
dic2[g] += p
for (k, v) in sorted(dic2.items(), key=lambda x:x[1], reverse=True):
for (i, p) in sorted(dic1[k], key=lambda x:x[1], reverse=True)[:2]:
answer.append(i)
return answer