코테/프로그래머스

import copy def solution(key, lock): answer = True M = len(key) N = len(lock) mlen = 2 * M + (N-2) tmap = [[-1 for i in range(mlen)] for j in range(mlen)] for i in range(M-1, M - 1 + N): for j in range(M-1, M - 1 + N): tmap[i][j] = lock[i - M + 1][j - M + 1] for x in range(0, mlen - M + 1): for y in range(0,mlen - M + 1 ): for i in range(4): aftermap = insertkey(x,y,key, tmap, M) if check(afterm..

def solution(s): N = len(s) answer = N cut = 1 ansstr = '' while 1: lst = [] if cut == N + 1: break for i in range(0,N, cut): lst.append(s[i:i+cut]) dict ={} anslst ='' for j in range(len(lst)-1): if lst[j] == lst[j+1]: if lst[j] not in dict: dict[lst[j]] = 2 else: dict[lst[j]] += 1 elif lst[j] != lst[j+1]: if lst[j] in dict: anslst+=lst[j]+str(dict[lst[j]]) dict.pop(lst[j], None) else: anslst+=..

dfs 풀이 answer= [] def solution(tickets): global answer start =[] N = len(tickets) for i in range(N): if tickets[i][0] == "ICN": for j in range(N): if j != i and tickets[i][1] == tickets[j][0]: start.append((tickets[i][1], i)) break start.sort(key = lambda x:x[0]) startidx = start[0][1] visited = [startidx] cur = tickets[startidx][1] ans = [tickets[startidx][0], tickets[startidx][1]] dfs(startidx..

ans = -1 def solution(begin, target, words): global ans if target not in words: return 0 else: dfs(begin, target, words, 0) return ans def checkwords(a, b): ret = 0 for i in range(len(a)): if a[i] == b[i]: ret +=1 if ret== (len(a)-1): return True else: return False def dfs(begin, target, words, cnt,visited=[]): global ans if begin == target: if ans > cnt or ans == -1: ans = cnt return for i in w..

def solution(genres, plays): dict = {} #장르 합계 playlst = {} # 장르별 음악 (idx, plays[idx]) gset = set(genres) N = len(genres) #dict, playlst 초기화 for i in gset: dict[i] = 0 playlst[i] =[] for i in range(N): dict[genres[i]] += plays[i] playlst[genres[i]].append((i, plays[i])) dict = sorted(dict.items(), key = lambda item: item[1], reverse = True) answer = [] for k,v in dict: lst = list(playlst[k]) lst...

def solution(clothes): answer = 1 dict = {} for i in clothes: if i[1] not in dict: dict[i[1]] = [i[0]] else: dict[i[1]].append(i[0]) for key in dict: answer *= len(dict[key])+1 return answer-1

def solution(phone_book): dict = {} for i in phone_book: dict[i] = 1 for i in phone_book: temp = '' for j in i: temp += j if temp in dict and temp != i: return False answer = True return answer

내 풀이 import collections def solution(nums): dict = collections.Counter(nums) if (len(nums) // 2) >= len(dict): return len(dict) else: return len(nums) // 2 다른사람 풀이 def solution(ls): return min(len(ls)/2, len(set(ls)))