Please solve the programming task below using a self-contained code snippet in a markdown code block.

You are given an integer array nums. The absolute sum of a subarray [numsl, numsl+1, ..., numsr-1, numsr] is abs(numsl + numsl+1 + ... + numsr-1 + numsr).
Return the maximum absolute sum of any (possibly empty) subarray of nums.
Note that abs(x) is defined as follows:

If x is a negative integer, then abs(x) = -x.
If x is a non-negative integer, then abs(x) = x.

 
Please complete the following python code precisely:
```python
class Solution:
    def maxAbsoluteSum(self, nums: List[int]) -> int:
```