Maximum Subarray II
Question:
Given an array of integers, find two non-overlapping subarrays which have the largest sum.
The number in each subarray should be contiguous.
Return the largest sum.
Notice
The subarray should contain at least one number
Answer:
class Solution {
public:
/*
* @param nums: A list of integers
* @return: An integer denotes