1067 Sort with Swap(0, i) (25 分)
1067 Sort with Swap(0, i) (25 分)
Given any permutation of the numbers {0, 1, 2,…, N−1}, it is easy to sort them in increasing order. But what if Swap(0, *) is the ONLY operation that is allowed to use...
原创
2019-03-04 10:13:20 ·
199 阅读 ·
0 评论