1388. Pizza With 3n Slices Hard

1/**
2 * [1388] Pizza With 3n Slices
3 *
4 * There is a pizza with 3n slices of varying size, you and your friends will take slices of pizza as follows:
5 * 
6 * 	You will pick any pizza slice.
7 * 	Your friend Alice will pick the next slice in the anti-clockwise direction of your pick.
8 * 	Your friend Bob will pick the next slice in the clockwise direction of your pick.
9 * 	Repeat until there are no more slices of pizzas.
10 * 
11 * Given an integer array slices that represent the sizes of the pizza slices in a clockwise direction, return the maximum possible sum of slice sizes that you can pick.
12 *  
13 * Example 1:
14 * <img alt="" src="https://assets.leetcode.com/uploads/2020/02/18/sample_3_1723.png" style="width: 500px; height: 266px;" />
15 * Input: slices = [1,2,3,4,5,6]
16 * Output: 10
17 * 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.
18 * 
19 * Example 2:
20 * <img alt="" src="https://assets.leetcode.com/uploads/2020/02/18/sample_4_1723.png" style="width: 500px; height: 299px;" />
21 * Input: slices = [8,9,8,6,1,1]
22 * Output: 16
23 * 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.
24 * 
25 *  
26 * Constraints:
27 * 
28 * 	3 * n == slices.length
29 * 	1 <= slices.length <= 500
30 * 	1 <= slices[i] <= 1000
31 * 
32 */
33pub struct Solution {}
34
35// problem: https://leetcode.com/problems/pizza-with-3n-slices/
36// discuss: https://leetcode.com/problems/pizza-with-3n-slices/discuss/?currentPage=1&orderBy=most_votes&query=
37
38// submission codes start here
39
40impl Solution {
41    pub fn max_size_slices(slices: Vec<i32>) -> i32 {
42        0
43    }
44}
45
46// submission codes end
47
48#[cfg(test)]
49mod tests {
50    use super::*;
51
52    #[test]
53    fn test_1388() {
54    }
55}
56