Minimum Operations to Make Array Equal to Target

Given two equal-length arrays, find the minimum number of operations that add or subtract 1 to every element of any chosen contiguous subarray to turn nums into target. The core challenge is to optimize a sequence of unit range-updates, which is solved by analyzing the element-wise difference array and greedily aggregating contiguous rises and falls.