2018年7月14日
[LeetCode] 801. Minimum Swaps To Make Sequences Increasing 使得序列递增的最小交换
摘要： We have two integer sequences A and B of the same non-zero length. We are allowed to swap elements A[i] and B[i]. Note that both elements are in the s 阅读全文
posted @ 2018-07-14 23:56 Grandyang 阅读(6138) 评论(1) 推荐(0)
Fork me on GitHub