시나위

1차 시도 def solution(people, limit): answer = 0 people.sort() #print(people) while people!=[]: answer+=1 tmp1=people.pop() tmp2=limit-tmp1 #print(tmp1,tmp2,people) if people==[]: break elif tmp1==limit: continue elif tmp2tmp3: continue return answer 2차시도 def solution(people, limit): answer = 0 people.sort() while people!=[]: answer+=1 tmp=people.pop() remainder=limit-tmp if people==[]: break elif ..

1차시도(여러번 했지만 ㅋㅋ) def solution(number, k): answer = '' front='' rear='' cnt=20 while k>0: max_num=max(number) max_ind=number.index(max_num) if max_ind==0: front+=number[0] number=number[1:] if k>=max_ind: number=number[max_ind:] k-=max_ind else: rear=number[max_ind:]+rear number=number[:max_ind] #print("front:{}\tnumber:{}\trear:{}\tk:{}".format(front,number,rear,k)) if number=='': if k==1: front..

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: ..