問題詳情
【題組】(14) Suppose an integer x is not in the NCTU linked list, what is the time complexity to insert the integer x into the NCTU linked list?
(A)O(logm*n/m)
(B) O(logm+n/m)
(C) O(m+n/m)
(D) O(logm*n/m+m)
(E) None of the above.
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增