Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Example:

Input: [-2,1,-3,4,-1,2,1,-5,4],

Output: 6

Explanation: [4,-1,2,1] has the largest sum = 6.

Follow up:

If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

Solution:

```
func max(a, b int) int {
if a > b {
return a
}
return b
}
func maxSubArray(nums []int) int {
currentSubSum := nums[0]
maxValue := nums[0]
lenN := len(nums)
for i := 1; i < lenN; i++ {
currentSubSum = max(nums[i], currentSubSum + nums[i])
maxValue = max(maxValue, currentSubSum)
}
return maxValue
}
```