[LeetCode] 1046. Last Stone Weight - 문제풀이 Description 주어진 돌들의 배열에서 아래의 룰에따라 돌을 부셔나갈때 마지막에 남는 돌을 반환하는 문제입니다. You are given an array of integers stones where stones[i] is the weight of the ith stone. We are playing a game with the stones. On each turn, we choose the heaviest two stones and smash them together. Suppose the heaviest two stones have weights x and y with x 알고리즘/LeetCode 2022. 4. 7. 13:34
