Given an integer array nums, find the subarray with the largest sum, and return its sum.
Example 1:
Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: The subarray [4,-1,2,1] has the largest sum 6.
Example 2:
Input: nums = [1] Output: 1 Explanation: The subarray [1] has the largest sum 1.
Example 3:
Input: nums = [5,4,-1,7,8] Output: 23 Explanation: The subarray [5,4,-1,7,8] has the largest sum 23.
Constraints:
1 <= nums.length <= 105-104 <= nums[i] <= 104
class Solution {
public int maxSubArray(int[] nums) {
int currsum = nums[0];
int max = nums[0];
for(int i=1;i<nums.length;i++){
if(currsum + nums[i] > nums[i]){
currsum+=nums[i];
}else{
currsum = nums[i];
}
max = Math.max(max , currsum);
}
return max ;
}
}
Office:- 660, Sector 14A, Vasundhara, Ghaziabad, Uttar Pradesh - 201012, India
