Sword finger offer 42 Maximum sum of continuous subarrays

The finger of the sword Offer 42. The maximum sum of successive subarrays

class Solution {
    
    public int maxSubArray(int[] nums) {
    
        int pre = -100, ans = nums[0];
        for(int x : nums){
    
            pre = pre < 0 ? x : pre + x; //  Start again when sum is negative 
            if(pre > ans) ans = pre;
        }
        return ans;
    }
}