Leetcode Problem 801. Minimum Swaps To Make Sequences Increasing

801. Minimum Swaps To Make Sequences Increasing

Leetcode Solutions

Initialize swap[0] to 1 and not_swap[0] to 0 since the first element can be considered as already sorted.
Iterate through the arrays from index 1 to n-1.
For each index i, check if nums1[i] and nums2[i] are both greater than nums1[i-1] and nums2[i-1] respectively (no swap needed at i-1), and also check if nums1[i] is greater than nums2[i-1] and nums2[i] is greater than nums1[i-1] (swap needed at i-1).
Update swap[i] and not_swap[i] based on the conditions checked in step 3.
The minimum number of swaps needed is the minimum of swap[n-1] and not_swap[n-1].

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen