<p>You are given two positive integer arrays <code>nums</code> and <code>target</code>, of the same length.</p>

<p>In a single operation, you can select any subarray of <code>nums</code> and increment each element within that subarray by 1 or decrement each element within that subarray by 1.</p>

<p>Return the <strong>minimum</strong> number of operations required to make <code>nums</code> equal to the array <code>target</code>.</p>

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

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">nums = [3,5,1,2], target = [4,6,2,4]</span></p>

<p><strong>Output:</strong> <span class="example-io">2</span></p>

<p><strong>Explanation:</strong></p>

<p>We will perform the following operations to make <code>nums</code> equal to <code>target</code>:<br />
- Increment&nbsp;<code>nums[0..3]</code> by 1, <code>nums = [4,6,2,3]</code>.<br />
- Increment&nbsp;<code>nums[3..3]</code> by 1, <code>nums = [4,6,2,4]</code>.</p>
</div>

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

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">nums = [1,3,2], target = [2,1,4]</span></p>

<p><strong>Output:</strong> <span class="example-io">5</span></p>

<p><strong>Explanation:</strong></p>

<p>We will perform the following operations to make <code>nums</code> equal to <code>target</code>:<br />
- Increment&nbsp;<code>nums[0..0]</code> by 1, <code>nums = [2,3,2]</code>.<br />
- Decrement&nbsp;<code>nums[1..1]</code> by 1, <code>nums = [2,2,2]</code>.<br />
- Decrement&nbsp;<code>nums[1..1]</code> by 1, <code>nums = [2,1,2]</code>.<br />
- Increment&nbsp;<code>nums[2..2]</code> by 1, <code>nums = [2,1,3]</code>.<br />
- Increment&nbsp;<code>nums[2..2]</code> by 1, <code>nums = [2,1,4]</code>.</p>
</div>

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

<ul>
	<li><code>1 &lt;= nums.length == target.length &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= nums[i], target[i] &lt;= 10<sup>8</sup></code></li>
</ul>

class Solution:
    def minimumOperations(self, nums: List[int], target: List[int]) -> int:
        differences = [target[i] - nums[i] for i in range(len(nums))]

        if not differences[0]:
            current_value = 0
        else:
            current_value = differences[0] / abs(differences[0])

        current_group = 0
        groups = [[]]
        for i in range(len(differences)):
            if differences[i] == 0:
                test_value, current_value = 0, 0
                groups[current_group].append(0)

            else:
                test_value = differences[i]/abs(differences[i])

            if test_value != current_value:
                current_group += 1
                groups.append([differences[i]])
                current_value = test_value
            
            elif test_value == current_value:
                groups[current_group].append(differences[i])
        
        operations = 0
        for i in range(len(groups)):
            if groups[i][0] > 0:
                bar = 0
                for j in range(len(groups[i])):
                    if groups[i][j] > bar:
                        operations += groups[i][j] - bar
                        bar = groups[i][j]
                    elif groups[i][j] < bar:
                        bar = groups[i][j]
            elif groups[i][0] < 0:
                bar = 0
                for j in range(len(groups[i])):
                    if groups[i][j] < bar:
                        operations += abs(groups[i][j] - bar)
                        bar = groups[i][j]
                    elif groups[i][j] > bar:
                        bar = groups[i][j]
        
        return operations
36200