Package g1001_1100.s1046_last_stone_weight

Class Solution

java.lang.Object
g1001_1100.s1046_last_stone_weight.Solution
public class Solution extends Object
1046 - Last Stone Weight.<p>Easy</p> <p>You are given an array of integers <code>stones</code> where <code>stones[i]</code> is the weight of the <code>i<sup>th</sup></code> stone.</p> <p>We are playing a game with the stones. On each turn, we choose the <strong>heaviest two stones</strong> and smash them together. Suppose the heaviest two stones have weights <code>x</code> and <code>y</code> with <code>x <= y</code>. The result of this smash is:</p> <ul> <li>If <code>x == y</code>, both stones are destroyed, and</li> <li>If <code>x != y</code>, the stone of weight <code>x</code> is destroyed, and the stone of weight <code>y</code> has new weight <code>y - x</code>.</li> </ul> <p>At the end of the game, there is <strong>at most one</strong> stone left.</p> <p>Return <em>the smallest possible weight of the left stone</em>. If there are no stones left, return <code>0</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> stones = [2,7,4,1,8,1]</p> <p><strong>Output:</strong> 1</p> <p><strong>Explanation:</strong></p> <p>We combine 7 and 8 to get 1 so the array converts to [2,4,1,1,1] then,</p> <p>we combine 2 and 4 to get 2 so the array converts to [2,1,1,1] then,</p> <p>we combine 2 and 1 to get 1 so the array converts to [1,1,1] then,</p> <p>we combine 1 and 1 to get 0 so the array converts to [1] then that&rsquo;s the value of the last stone.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> stones = [1]</p> <p><strong>Output:</strong> 1</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= stones.length <= 30</code></li> <li><code>1 <= stones[i] <= 1000</code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • lastStoneWeight

      public int lastStoneWeight(int[] stones)