LeetCode - #53 Maximum Subarray: Failed

30_day_03_maximum_subarray.cpp

#include <vector>
#include <numeric>

class Solution {
public:
	int summize(std::vector<int> nums)
	{
		int result=std::accumulate(nums.begin(),nums.end(),0);
		if (nums.size() == 2)
		{
			if (nums[0] > result || nums[1] > result) return nums[0] > nums[1] ? nums[0] : nums[1];
		}
		if (nums.size() < 2) return result;
		int left=summize({nums.begin(),nums.end()-1});
		int right=summize({nums.begin()+1,nums.end()});
		if (left > result || right > result) return left > right ? left : right;
		return result;
	}

	int maxSubArray(std::vector<int>& nums)
	{
		return summize(nums);
	}
};