Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
(A subarray is a contiguous part of an array.)
Checklist:
[x] My code follows the style guidelines of this project
[x] I have made corresponding changes to the documentation
[x] I have added tests that prove my fix is effective or that my feature works
Description
Solved maximum sum using java
Problem Title: Maximum Sum
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. (A subarray is a contiguous part of an array.)
Checklist: