BOJ

🖥️ 입문자를 위한 코딩테스트 핵심 - Python (김태원, 인프런) 섹션2. 배열, 연결리스트, deque (백준) 17608번: 막대기https://www.acmicpc.net/problem/17608 풀이def solution(sticks): answer = 1 newArr = [] for i in range(len(sticks)): newArr.append(sticks.pop()) std = newArr[0] for i in range(1, len(newArr)): if newArr[i] > std: answer += 1 std = newArr[i] return answer;n = int(input())arr = []f..