Package g2201_2300.s2202_maximize_the_topmost_element_after_k_moves

Class Solution

java.lang.Object
g2201_2300.s2202_maximize_the_topmost_element_after_k_moves.Solution
public class Solution extends Object
2202 - Maximize the Topmost Element After K Moves.<p>Medium</p> <p>You are given a <strong>0-indexed</strong> integer array <code>nums</code> representing the contents of a <strong>pile</strong> , where <code>nums[0]</code> is the topmost element of the pile.</p> <p>In one move, you can perform <strong>either</strong> of the following:</p> <ul> <li>If the pile is not empty, <strong>remove</strong> the topmost element of the pile.</li> <li>If there are one or more removed elements, <strong>add</strong> any one of them back onto the pile. This element becomes the new topmost element.</li> </ul> <p>You are also given an integer <code>k</code>, which denotes the total number of moves to be made.</p> <p>Return <em>the <strong>maximum value</strong> of the topmost element of the pile possible after <strong>exactly</strong></em> <code>k</code> <em>moves</em>. In case it is not possible to obtain a non-empty pile after <code>k</code> moves, return <code>-1</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [5,2,2,4,0,6], k = 4</p> <p><strong>Output:</strong> 5</p> <p><strong>Explanation:</strong></p> <p>One of the ways we can end with 5 at the top of the pile after 4 moves is as follows:</p> <ul> <li> <p>Step 1: Remove the topmost element = 5. The pile becomes [2,2,4,0,6].</p> </li> <li> <p>Step 2: Remove the topmost element = 2. The pile becomes [2,4,0,6].</p> </li> <li> <p>Step 3: Remove the topmost element = 2. The pile becomes [4,0,6].</p> </li> <li> <p>Step 4: Add 5 back onto the pile. The pile becomes [5,4,0,6].</p> </li> </ul> <p>Note that this is not the only way to end with 5 at the top of the pile. It can be shown that 5 is the largest answer possible after 4 moves.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [2], k = 1</p> <p><strong>Output:</strong> -1</p> <p><strong>Explanation:</strong></p> <p>In the first move, our only option is to pop the topmost element of the pile.</p> <p>Since it is not possible to obtain a non-empty pile after one move, we return -1.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10<sup>5</sup></code></li> <li><code>0 <= nums[i], k <= 10<sup>9</sup></code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • maximumTop

      public int maximumTop(int[] nums, int k)