-
-
-
无向图G=(V E),其中V={a,b,c,d,e,f},E={<a,b>,<a,e>,<a,c>,<b,e>,<c,f>,<f,d>,<e,d>}对该图进行深度优先排序,得到的顶点序列正确的是()
a,b,e,c,d,f
a,c,f,e,b,d
a,e,b,c,f,d
a,e,d,f,c,b ...
阅读题目
单选题
经典指数
-
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 ...
阅读题目
面试题
经典指数
-
-
-
-
-
-
扫描后移动端查看
相关标签
同类标签
|
微信公众号
|
|
欢迎加入,一起群聊
|