Programs/Algorithms during this journey

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.\

current_sum=overallsum=a[0] i=1--->n current_sum=max(a[i],current_sum+a[i]) overallsum=max(overallsum,current_sum) return overallsum

class Solution { public int maxSubArray(int[] nums) { int sum,currentSum; sum=currentSum=nums[0]; for(int i=1;i<nums.length;i++) { currentSum=Math.max(nums[i],currentSum+nums[i]); sum=Math.max(currentSum,sum); } return sum; } }