from typing import List
import re
# TODO
class Solution:
    # 最长递增为1的序列的开始结束位置
    def minSwaps(self, nums: List[int]) -> int:
        pass

if __name__ =="__main__":
    func = Solution().minSwaps
    nums =[]
    print(func(nums))