Implement a function, input a array of int, you need to return x,y,z to get the max sum(nums[x] + nums[x + 1] + ... + nums[y - 1] + nums[y + 1] + ... + nums[z]). 0 <= x < y < z < nums.length.
eg.

public List<Integer> getPartitions(int[] nums) {
}