leetcode 1388. 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 next slice in anti clockwise direction of your pick. 
• Your friend Bob will pick next slice in clockwise direction of your pick.
• Repeat until there are no more slices of pizzas.

Sizes of Pizza slices is represented by circular array slices in clockwise direction.

Return the maximum possible sum of slice sizes which you can have.

 

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
Output: Pick pizza slice of size 8 in each turn. If you pick slice with size 9 your partners will pick slices of size 8.

Example 3:

Input: slices = [4,1,2,5,8,3,1,9,7]
Output: 21

Example 4:

Input: slices = [3,1,2]
Output: 3

题目 披萨切成3n份，3个人分，每选一块，相邻两块就被其他两人分，求获取最大面积。

典型的DP,不过需要注意的是选择第一片了就不能选最后一片，分两种情况求解即可。代码如下：

class Solution(object):
    def maxSizeSlices(self, slices):
        """
        :type slices: List[int]
        :rtype: int
        """
        l = len(slices)
        n = l//3
        tmp = [[0 for _ in range(l)] for _ in range(n)]
        maxValue = slices[0]
        tmp[0][0] = 0  # 不使用第一块
        for i in range(1,l - 2*(n-1)):
            tmp[0][i] = max(slices[i],tmp[0][i-1])
        for i in range(1,n):
            for j in range(i*2,l - 2*(n - i - 1)): # 可以用到最后一块
                tmp[i][j] = max(slices[j]+tmp[i-1][j-2],tmp[i][j-1])
        ret = tmp[-1][-1]
        tmp = [[0 for _ in range(l)] for _ in range(n)]
        for i in range(0,l  - 2*(n-1)): # 使用第一块
            tmp[0][i] = slices[0]
        for i in range(1,n): 
            for j in range(i*2,l - 2*(n - i - 1)-1): # 不可以使用最后一块
                tmp[i][j] = max(slices[j]+tmp[i-1][j-2],tmp[i][j-1])
        return max(ret,tmp[-1][-2])