Package g1301_1400.s1388_pizza_with_3n_slices

Class Solution

java.lang.Object
g1301_1400.s1388_pizza_with_3n_slices.Solution
public class Solution extends Object
1388 - Pizza With 3n Slices.<p>Hard</p> <p>There is a pizza with <code>3n</code> slices of varying size, you and your friends will take slices of pizza as follows:</p> <ul> <li>You will pick <strong>any</strong> pizza slice.</li> <li>Your friend Alice will pick the next slice in the anti-clockwise direction of your pick.</li> <li>Your friend Bob will pick the next slice in the clockwise direction of your pick.</li> <li>Repeat until there are no more slices of pizzas.</li> </ul> <p>Given an integer array <code>slices</code> that represent the sizes of the pizza slices in a clockwise direction, return <em>the maximum possible sum of slice sizes that you can pick</em>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/02/18/sample_3_1723.png" alt="" /></p> <p><strong>Input:</strong> slices = [1,2,3,4,5,6]</p> <p><strong>Output:</strong> 10</p> <p><strong>Explanation:</strong> Pick pizza slice of size 4, Alice and Bob will pick slices with size 3 and 5 respectively. Then Pick slices with size 6, finally Alice and Bob will pick slice of size 2 and 1 respectively. Total = 4 + 6.</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/02/18/sample_4_1723.png" alt="" /></p> <p><strong>Input:</strong> slices = [8,9,8,6,1,1]</p> <p><strong>Output:</strong> 16</p> <p><strong>Explanation:</strong> Pick pizza slice of size 8 in each turn. If you pick slice with size 9 your partners will pick slices of size 8.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>3 * n == slices.length</code></li> <li><code>1 <= slices.length <= 500</code></li> <li><code>1 <= slices[i] <= 1000</code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • maxSizeSlices

      public int maxSizeSlices(int[] slices)