<p>Given an array of integers <code>nums</code> and an integer <code>limit</code>, return the size of the longest <strong>non-empty</strong> subarray such that the absolute difference between any two elements of this subarray is less than or equal to <code>limit</code><em>.</em></p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [8,2,4,7], limit = 4
<strong>Output:</strong> 2 
<strong>Explanation:</strong> All subarrays are: 
[8] with maximum absolute diff |8-8| = 0 &lt;= 4.
[8,2] with maximum absolute diff |8-2| = 6 &gt; 4. 
[8,2,4] with maximum absolute diff |8-2| = 6 &gt; 4.
[8,2,4,7] with maximum absolute diff |8-2| = 6 &gt; 4.
[2] with maximum absolute diff |2-2| = 0 &lt;= 4.
[2,4] with maximum absolute diff |2-4| = 2 &lt;= 4.
[2,4,7] with maximum absolute diff |2-7| = 5 &gt; 4.
[4] with maximum absolute diff |4-4| = 0 &lt;= 4.
[4,7] with maximum absolute diff |4-7| = 3 &lt;= 4.
[7] with maximum absolute diff |7-7| = 0 &lt;= 4. 
Therefore, the size of the longest subarray is 2.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [10,1,2,4,7,2], limit = 5
<strong>Output:</strong> 4 
<strong>Explanation:</strong> The subarray [2,4,7,2] is the longest since the maximum absolute diff is |2-7| = 5 &lt;= 5.
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums = [4,2,2,2,4,4,2,2], limit = 0
<strong>Output:</strong> 3
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
	<li><code>0 &lt;= limit &lt;= 10<sup>9</sup></code></li>
</ul>

INF = float("inf")

class Stack:
    def __init__(self):
        self.s = []
        self.smin = [INF]
        self.smax = [-INF]

    def push(self, num):
        self.s.append(num)
        self.smin.append(min(self.smin[-1], num))
        self.smax.append(max(self.smax[-1], num))
    
    def pop(self):
        self.smin.pop()
        self.smax.pop()
        return self.s.pop()
    
    def empty(self):
        return not self.s
    
    def min(self):
        return self.smin[-1]
    
    def max(self):
        return self.smax[-1]


class Solution:
    def longestSubarray(self, nums: List[int], k: int) -> int:
        old = Stack()
        new = Stack()

        def add(num):
            new.push(num)

        def remove():
            if old.empty():
                while not new.empty():
                    old.push(new.pop())
            
            old.pop() 

        def isgood():
            mx = max(old.max(), new.max())
            mn = min(old.min(), new.min())
            return mx - mn <= k

        l = res = 0
        for r in range(len(nums)):
            add(nums[r])
            while not isgood():
                remove()
                l += 1
            
            res = max(res, r - l + 1)
        
        return res
1255