53.Maximum Subarray,Kadane's Algo

int maxSubArray(vector<int>& nums) {
        
         int currentSum = nums[0];
        int currentMax = nums[0];
        for (int i = 1; i <nums.size(); i++){
         
            currentSum+=nums[i];
            
            if(currentSum<nums[i])
                currentSum=nums[i];
            
            currentMax=max(currentSum,currentMax);
        }
        return currentMax;
    }