1749. Maximum Absolute Sum of Any Subarray

class Solution {
public:
    int maxAbsoluteSum(vector<int>& nums) {
        int currsum=0;
        int maxsum=0;
        for(int i=0; i<nums.size(); i++)
        {
            currsum+=nums[i];
            if(currsum>maxsum)
           {
             maxsum=currsum;  
           } 
           if(currsum<0)
           currsum=0;
        }
        int ans1=maxsum;
        currsum=0;
        maxsum=0;
          for(int i=0; i<nums.size(); i++)
        {
            currsum+=nums[i];
            if(currsum<maxsum)
           {
             maxsum=currsum;  
           } 
           if(currsum>0)
           currsum=0;
        }
        int ans2=abs(maxsum);
        return max(ans1,ans2);
    }
};