You are given two integer arrays nums1 of length n and nums2 of length n $+ 1$.

In one operation, you can perform either of the following actions:

• Choose any element in nums1 and increase or decrease its value by $1$.

• Choose any element in nums1 and append a copy of it to the end of nums1.

Return the minimum number of operations required to make nums1 identical to nums2.

Constraints:

• $1 \leq$ n $==$ nums1.length $\leq 10^5$

• nums2.length $==$ n $+ 1$

• $1 \leq$ nums1[i], nums2[i] $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.