시나위

N = input() number = dict() for char in N: if not char in number: number[char] = 0 number[char] += 1 if ('6' in number) and ('9' in number): number['6'] += number['9'] number['6'] = (number['6'] + 1)//2 elif '6' in number: number['6'] = (number['6'] + 1)//2 elif '9' in number: number['9'] = (number['9'] + 1)//2 need=sorted(number.values(),reverse=True) print(need[0]) 딕셔너리에 각 숫자들이 몇번 나오는지 저장하고, 6..

def solution(s): if len(s) % 2: #홀수 경우는 불가능 return 0 list_s = list(s) stack = [] for i in range(len(s)): tmp = list_s.pop() if stack == []: stack.append(tmp) elif stack[-1] == tmp: stack.pop() elif stack[-1] != tmp: stack.append(tmp) if stack != []: return 0 return 1 위 코드는 타인의 코드를 보고 생각해보며 내 방식대로 적은 코드이다. 스택의 개념에 대해서는 알지만 어떻게 사용해야할지 잘 몰랐던 것 같다. 스택이 비었을때 추가하고, 스택에 값이 있을때 비교하는것... 앞으로는 제발 잊지 않았으면 ..

def solution(land): answer = 0 N = len(land) for i in range(0,N-1): land[i+1][0] += max(land[i][1],land[i][2],land[i][3]) land[i+1][1] += max(land[i][0],land[i][2],land[i][3]) land[i+1][2] += max(land[i][0],land[i][1],land[i][3]) land[i+1][3] += max(land[i][0],land[i][1],land[i][2]) answer = max(land[N-1]) return answer 출처: https://ssungkang.tistory.com/entry/%EB%95%85%EB%94%B0%EB%A8%B9%EA%B8%B0..

import math def solution(brown, red): answer = [] sq_red=int(math.sqrt(red)) a,b=0,0 for num in range(1,sq_red+1): flt_rv=red/num int_rv=red//num if flt_rv==int_rv: flt_bv=(brown+red)/(int_rv+2) int_bv=(brown+red)//(int_rv+2) if flt_bv==int_bv: b=int_bv a=(brown+red)//b answer=[a,b] return answer

def solution(numbers, target): answer_list=[0] for i in numbers: temporary_list=[] #print("\nanswer_list:",answer_list) for j in answer_list: temporary_list.append(j+i) temporary_list.append(j-i) #print("tmp_list",temporary_list) answer_list=temporary_list #print("answer_list",answer_list) answer = answer_list.count(target) return answer 방법은 똑같았으나 구현하지 못해 내 코드는 아니지만 올린다.

def solution(clothes): answer = 1 tmp={} for cloth in clothes: if cloth[1] in tmp: tmp[cloth[1]]+=1 else: tmp[cloth[1]]=1 for k in tmp.values(): answer*=k+1 return answer-1

from itertools import permutations def solution(baseball): answer = 0 correct=list(permutations([1,2,3,4,5,6,7,8,9], 3)) for i in range(len(baseball)): tmp=tuple(map(int,list(str(baseball[i][0])))) #print("tmp:",tmp) cr_num=0 try: while correct!=[]: st_chk=0 b_chk=0 #check strike and ball if tmp[0]==correct[cr_num][0]: st_chk+=1 elif tmp[0]==correct[cr_num][1]: b_chk+=1 elif tmp[0]==correct[cr_n..

1차시도 def solution(name): answer = 0 init="A"*len(name) for i in range(len(name)):# ascii: A=65 Z=90 if ord(name[i]) == 65: pass else: tmp=ord(name[i]) - 65 #print(tmp) if tmp>13: answer+=26-tmp else: answer+=tmp return answer 2차시도 def solution(name): answer = 0 len_name=len(name) init="A"*len_name chk=[] for i in range(len_name):# ascii: A=65 Z=90 if ord(name[i]) == 65: chk.append(1) pass else: ..

def solution(progresses, speeds): answer = [] while (progresses!=[]): ed=[] # complete len_p=len(progresses) for i in range(len_p): progresses[i]+=speeds[i] for i in range(len_p): if progresses[i]>=100: ed.append(progresses[i]) else: break if ed!=[]: answer.append(len(ed)) for i in ed: del progresses[0] del speeds[0] return answer

def solution(bridge_length, weight, truck_weights): answer = 0 ing=[] # 다리를 건너는 트럭 cnt=[] # 트럭당 지난 거리 ed=[] # 다리를 지난 트력 while 1: if (truck_weights == []) and (ing == []): break answer+=1 # count total time for i in range(len(cnt)): # decrease the times of trucks above the bridge cnt[i]-=1 if (cnt!=[])and(cnt[0]==0): ed.append(ing[0]) del cnt[0] del ing[0] if (sum(ing) max_weight: bridge.append(0..