목록프로그래머스 (3)
눈송이의 개발생활
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/bIEKJg/btrKwi2lTBk/YyrZFKhQg7qisJhGMXc0K1/img.png)
문제 https://school.programmers.co.kr/learn/courses/30/lessons/42584 내 코드 - 효율성 테스트 실패 def solution(prices): answer = [] while prices: temp = prices.pop(0) cnt = 0 for i in range(len(prices)): if prices[i] >= temp: cnt += 1 else: cnt += 1 break answer.append(cnt) return answer 다른 사람 풀이 from collections import deque def solution(prices): answer = [] p = deque(prices) while p: temp = p.popleft() cnt..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/oWEnt/btrzfAH6Z6C/r5juB9kAEkQo0uk8iRJeCk/img.png)
문제 https://programmers.co.kr/learn/courses/30/lessons/42747 내 코드 def solution(citations): count = 0 citations.sort() for i in range(citations[-1] + 1): new_c = [j for j in range(len(citations)) if citations[j] >= i] if len(new_c) >= i: count = i else: break return count 다른 사람 풀이 def solution(citations): citations = sorted(citations) l = len(citations) for i in range(l): if citations[i] >= l-i: r..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/YDKtn/btryKW5PGhl/K8Eq6ndkL8ogkKCZqKZ1e1/img.png)
문제 https://programmers.co.kr/learn/courses/30/lessons/42576 내 코드 #1 (실패) def solution(participant, completion): for i in range(len(completion)): if completion[i] in participant: participant.remove(completion[i]) answer = participant[0] if len(participant) != 0 else ' ' return answer 내 코드 #2 (성공) def solution(participant, completion): participant.sort() completion.sort() for p, c in zip(participa..