Pizza With 3n Slices
There is a pizza with 3n slices of varying size. You and your friends will take slices of pizza as follows:
- You will pick any pizza slice.
- Your friend Alice will pick the next slice in the anti-clockwise direction of your pick.
- Your friend Bob will pick the next slice in the clockwise direction of your pick.
- Repeat until there are no more slices of pizza.
Given an integer array slices that represents the sizes of the pizza slices in clockwise direction, return the maximum possible sum of slice sizes that you can pick.
Example 1
Input
slices = [1,2,3,4,5,6]Output
10Pick pizza slices of sizes 4 and 6, for a total of 10.
Example 2
Input
slices = [8,9,8,6,1,1]Output
16Pick pizza slice of size 8 in each turn; if you pick slice with size 9, your partners will pick slices of size 8.
Constraints
- 3 * n == slices.length
- 1 <= slices.length <= 500
- 1 <= slices[i] <= 1000