问题 Given an array of distinct integers.You can remove an element from the array and append it to the end of it.This is one MOVE and counted as one MOVE operation.Find the min no of moves required to sort the array. 回答1: As I understand it, moving an element to the end shifts all elements after that one place, so that moving the third element of [a_1, a_2, a_3, a_4, a_5, a_6] to the end produces [a_1, a_2, a_4, a_5, a_6, a_3] If that understanding is correct, the strategy with the minimum number