801. Minimum Swaps to make sequences increasing minimum number of interchanges required for two arrays to be strictly incremented

[Copy question]:

We have both integer sequences and of the A B same non-zero length.

We is allowed to swap elements A[i] and B[i] . Note that both elements is in the same index position in their respective sequences.

At the end of some number of swaps, and is A B both strictly increasing. (A sequence is strictly increasing if and only if A[0] < A[1] < A[2] < ... < A[A.length - 1] .)

Given A and B, return the minimum number of swaps to make both sequences strictly increasing. It is guaranteed, the given input always makes it possible.

EXAMPLE:INPUT:A = [1,3,5,4], B = [1,2,3,7]output:1explanation:swap a[3] and b[3].  Then the sequences are:a = [1, 3, 5, 7] and B = [1, 2, 3, 4]which is both strictly increasing.

[Brute force solution]:

Time Analysis:

Spatial Analysis:

[After optimization]:

Time Analysis:

Spatial Analysis:

[Wonderful output CONDITIONS]:

[Wonderful corner case]:

[Thinking questions]:

Be afraid of DP, do not know how to check after the Exchange

[English data structure or algorithm, why not other data structures or algorithms]:

[a sentence of thought]:

[input]: null: Normal: Large: Extra Small: Special cases handled in the program: abnormal conditions (unreasonable input):

[Drawing]:

[One brush]:

[Two brushes]:

[Three brushes]:

[Four brushes]:

[Five brushes]:

[Results of five-minute visual debug]:

[Summary]:

[Complexity]:time Complexity:o () Space complexity:o ()

[Algorithmic thinking: Recursion/division/greed]:

[Key templating code]:

[Other solutions]:

[Follow up]:

[The problem given by the LC becomes variable]:

[Code Style]:

801. Minimum Swaps to make sequences increasing minimum number of interchanges required for two arrays to be strictly incremented