<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:
        
        # [4, 6, 2, 4] - [3, 5, 1, 2] = [1, 1, 1, 2]
        # [2, 1, 4] - [1, 3, 2] = [1, -2, 2]

        # 1. calculate diff array
        # 2. iterate diff array, for each value, compare with previous value
        #    if both are positive -> if arr[i] > arr[i - 1]: add arr[i] - arr[i - 1] to ans
        #    if both are negatibe -> if arr[i] < arr[i - 1]: add arr[i - 1] - arr[i] to ans
        #   else: add abs(arr[i]) to value

        size = len(nums)
        diff_array = []
        for i in range(size):
            diff_array.append(target[i] - nums[i])
        
        ans = abs(diff_array[0])
        for i in range(1, size):
            if diff_array[i] * diff_array[i - 1] > 0:
                if abs(diff_array[i]) > abs(diff_array[i - 1]):
                    ans += abs(diff_array[i] - diff_array[i - 1])
            else:
                ans += abs(diff_array[i])

        return ans

32200