-
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? For example, to sort {4, 0, 2, 1, 3}
we may apply the swap operations in the following way:
Swap(0, 1) => {4, 1, 2, 0, 3}
Swap(0, 3) => {4, 1, 2, 3, 0}
Swap(0, 4) => {0, 1, 2, 3, 4}
Now you are asked to find the minimum number of swaps need to sort the
given permutation of the first N nonnegative integers.
输入描述:
Each inp ...
阅读题目
面试题
经典指数
-
-
已知有向图G=(V,E),其中V={V1,V2,V3,V4,V5,V6,V7},E={(V1,V2),(V1,V3),(V1,V4),(V2,V5),(V3,V5),(V3,V6),(V4,V6),(V5,V7),(V6,V7)},G的拓扑序列是()
V1,V3,V4,V6,V2,V5,V7
V1,V3,V2,V6,V4,V5,V7
V1,V3,V4,V5,V2,V6,V7
V1,V2,V5,V3,V4,V6,V7 ...
阅读题目
单选题
经典指数
-
-
-
-
-
-
-
扫描后移动端查看
相关标签
同类标签
|
微信公众号
|
|
欢迎加入,一起群聊
|