#1388

Pizza With 3n Slices

candidate master · 1325 · lc hard +32 · verified · 53.8% accepted · 1,135 likes · top 45%

Description

A pizza has 3n slices arranged in a circle, with sizes in clockwise order given by slices. You, Alice, and Bob alternate taking slices: you choose any slice, Alice takes the slice immediately counterclockwise from yours, and Bob takes the one immediately clockwise. This repeats until all slices are gone. Return the maximum total size of slices you can collect.

Example 1:

Input: slices = [1,2,3,4,5,6]

Output: 10

Explanation: 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.

Example 2:

Input: slices = [8,9,8,6,1,1]

Output: 16

Explanation: Pick pizza slice of size 8 in each turn. If you pick slice with size 9 your partners will pick slices of size 8.

Code

1

2

3

class Solution:
    def maxSizeSlices(self, slices: List[int]) -> int:

class Solution:
    def maxSizeSlices(self, slices: List[int]) -> int: