시나위

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

문제가 이해가 안되었다. 질문하기에도 나랑 비슷한 사람들이 많아서 도움을 얻었는데 해당 테스트 케이스를 보니 이해가 갔다. test case: [22, 42] return value:2 알고리즘 공부할때 문제를 읽고 이해하는 능력도 많이 중요한것 같다. 1차 시도 def solution(citations): answer = 0 max_cit=max(citations) for n in range(max_cit): tmp=list(i for i in citations if i>=n) length=len(tmp) if n>length: answer=n-1 break return answer

def solution(phone_book): answer = True stack=[] index=0 len_pb=len(phone_book) while index!=len_pb: stack=phone_book.pop() len_st=len(stack) for num in phone_book: len_num=len(num) if len_st>len_num: if num==stack[:len_num]: return False else: if num[:len_st]==stack: return False index+=1 return answer 쉽게 끝냈다

1차 시도 from itertools import permutations def solution(numbers): answer = '' ## permutation of elements of numbers numbers=list(map(str,numbers)) tmp=list(map(''.join, permutations(numbers))) answer=max(tmp) return answer 논리는 맞는거 같은데 permutation할때 시간이 오래 걸리는듯 하다. 2차시도 def solution(numbers): answer = '' tmp_nums=[] max_len=len(str(max(numbers))) for num in numbers: length=0 len_num=len(str(num)) t..

1차 시도 def solution(scoville, K): answer = 0 while True: scoville.sort() if scoville[0]==0 and scoville[1]==0: return -1 min1=scoville.pop(0) min2=scoville.pop(1) mixed=min1+min2*2 scoville.insert(0,mixed) answer+=1 if min(scoville)>=K: break return answer Heap에 관한 설명 https://gmlwjd9405.github.io/2018/05/10/data-structure-heap.html [자료구조] 힙(heap)이란 - Heee's Development Blog Step by step goes a lo..

from collections import deque def solution(heights): answer = [] heights=deque(heights) len_h=len(heights) for i in range(len_h): tmp=heights.pop() cnt=0 ind=0 for j in heights: cnt+=1 if tmp: ind=cnt answer.insert(0,ind) return answer

def solution(prices): len_p=len(prices) answer = [0]*len_p for i in range(len_p): tmp=prices[i+1:] for j in tmp: if prices[i]>j: answer[i]+=1 break else : answer[i]+=1 return answer def solution(prices): len_pr=len(prices) answer = [] for i in range(len_pr): tmp=prices[i+1:] cnt=0 for j in tmp: cnt+=1 if prices[i]>j: break answer.append(cnt) return answer from collections import deque def soluti..

def solution(priorities, location): answer = 0 while priorities!=[]: max_pr=max(priorities) ind_zr=priorities.pop(0) if max_pr==ind_zr: answer+=1 if location==0: break else: location -=1 else: priorities.append(ind_zr) if location==0: location=len(priorities)-1 else: location-=1 return answer

def solution(arrangement): answer = 0 iron = 0 arr=arrangement.replace("()","*") for i in arr: if i == '*': answer+=iron elif i =='(': iron+=1 elif i ==')': iron-=1 answer+=1 #print("i:{}\tiron:{}\tanswer:{}".format(i,iron,answer)) return answer 다른 사람풀이도 나랑 비슷하게 푼거 같으니 추가는 안하겠다

def solution(phone_number): len_pn=len(phone_number)-4 answer = '*'*len_pn+phone_number[-4:] return answer so easy ㅋㅋ