Hoo_Dev

def solution(board, moves): answer = 0 N = len(board) pop_lst = [] for i in moves: for j in range(N): if board[j][i-1] != 0: if pop_lst: if pop_lst[-1] == board[j][i-1]: answer += 2 pop_lst.pop() else: pop_lst.append(board[j][i-1]) else: pop_lst.append(board[j][i-1]) board[j][i-1] = 0 break return answer 2차원 배열을 순회하며 인형을 뽑는다. 만약 인형이 존재 할 때 인형을 뽑았던 리스트의 마지막과 현재 뽑은 인형을 비교하여 같다면 answer + 2 를 해주고 뽑았..

실패 코드 def solution(n, lost, reserve): answer = 0 every = [] lost = sorted(lost) reserve = sorted(reserve) for i in range(1, n+1): if i not in lost: every.append(i) else: for j in reserve: if j in lost: reserve.pop(0) every.append(j) break elif j - 1 == i or j + 1 == i: reserve.pop(0) every.append(i) break a = set(every) print(a) return len(a) 3, 5, 7, 10 테스트 케이스를 실패하는 코드. 이유는 아직 찾고있다.. 정답 코드 def..

def solution(N, stages): answer = [] ans_lst = [] stages = sorted(stages) for stage in range(1, N+1): cnt = stages.count(stage) if len(stages) != 0: ans_lst.append([cnt/len(stages), stage]) for i in range(cnt): stages.pop(0) else: ans_lst.append([0, stage]) ans_lst.sort(key = lambda x : (-x[0], x[1])) for i in ans_lst: answer.append(i[1]) return answer key lambda 를 사용한 sort 풀이. zero division 에러를..

def solution(n, arr1, arr2): answer = [] result = [] for arr in [arr1, arr2]: map = [] for i in range(n): get_map = [] m = arr[i] while m >= 1: a = m % 2 get_map.append(a) m //= 2 if len(get_map) < n: while len(get_map) < n: get_map.append(0) map.append(get_map[::-1]) result.append(map) for i in range(n): map_str = '' for j in range(n): if result[0][i][j] == 0 and result[1][i][j] == 0: map_str +..

def solution(new_id): answer = '' new_id = new_id.lower() lower_alpha = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'] is_num = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9'] for i in range(len(new_id)): if new_id[i] in lower_alpha or new_id[i] in is_num or new_id[i]== '-' or new_id[i]=='.' or new_id[i] == '_..

def solution(lottos, win_nums): answer = [] rank = {6:1, 5:2, 4:3, 3:4, 2:5} comp_lst = [0, 0] for i in lottos: if i == 0 or i in win_nums: comp_lst[0] += 1 if i != 0 and i in win_nums: comp_lst[1] += 1 for i in comp_lst: if i not in rank.keys(): answer.append(6) else: answer.append(rank[i]) return answer 최대로 맞춘 개수와 최소로 맞춘 개수를 비교배열에 저장한다. (최대 일 경우 0은 맞춘 개수로 생각, 최소 일 경우는 0은 틀린 개수로 생각한다.) 이후 맞춘 개수..

def solution(today, terms, privacies): answer = [] y, m, d = today.split('.') today_to_day = int(y) * 12 * 28 + int(m) * 28 + int(d) terms_dic = {} for i in terms: a = i.split(" ") terms_dic[a[0]] = int(a[1]) * 28 for i in range(len(privacies)): first = privacies[i].split(" ") second = first[0].split('.') change_day = int(second[0]) * 12 * 28 + int(second[1]) * 28 + int(second[2]) + terms_dic[fi..

def solution(s): answer = s dic = {'zero':0, 'one':1, 'two':2, 'three':3, 'four':4, 'five':5, 'six':6, 'seven':7, 'eight':8, 'nine':9} for i in dic.keys(): answer = answer.replace(i, str(dic[i])) return int(answer) 딕셔너리와 replace 함수를 이용한 풀이

def solution(survey, choices): answer = '' score = {1:3, 2:2, 3:1, 4:0, 5:1, 6:2, 7:3} mbti = {'R':0, 'T':0, 'C':0, 'F':0, 'J':0, 'M':0, 'A':0, 'N':0} mbti_lst=['R', 'T', 'C', 'F', 'J', 'M', 'A', 'N'] for i in range(len(survey)): if choices[i] 4: mbti[survey[i][1]] += score[choices[i]] for i in range(0, len(mbti_lst), 2): if mbti[mbt..

def solution(X, Y): answer = '' count_X = [0] * 10 count_Y = [0] * 10 for i in [X, Y]: for j in i: if i == X: count_X[int(j)] += 1 else: count_Y[int(j)] += 1 for i in range(9, -1, -1): add = '' if count_X[i]