Stack/Que6 [python] 주식가격 문제 출처 주식가격 풀이 def solution(prices): length = len(prices) answer = [0]*length for i in range(0, length-1): for j in range(i+1, length): if prices[j] < prices[i]: answer[i] = j-i break else: answer[i] = length-1-i return answer 2019. 8. 25. [python] 기능개발 문제 출처 기능 개발 풀이 def solution(progresses, speeds): answer = [] idx, length = 0, len(progresses) while idx < length: for i in range(idx, length): progresses[i] += speeds[i] cnt = 0 while idx < length: if progresses[idx] < 100: break else: cnt += 1 idx += 1 if cnt: answer.append(cnt) return answer 2019. 8. 25. [python] 다리를 지나는 트럭 문제 출처 다리를 지나는 트럭 풀이 def solution(bridge_length, weight, truck_weights): answer = 0 going = [] while 1: answer += 1 for truck in going: truck[0] += 1 if going and going[0][0] > bridge_length: truck = going.pop(0) weight += truck[1] if weight - truck_weights[0] >= 0: truck_weight = truck_weights.pop(0) weight -= truck_weight going.append([1, truck_weight]) else: spend = bridge_length - going[0][0].. 2019. 8. 25. [python] 쇠막대기 문제 출처 쇠막대기 풀이 def solution(arrangement): answer = 0 pipe = 1 stack = '' for i in range(1, len(arrangement)): if arrangement[i] == '(': pipe += 1 else: pipe -= 1 if arrangement[i-1] == '(': answer += pipe else: answer += 1 return answer 2019. 8. 25. 이전 1 2 다음
