m0_49097785的博客

静态链表实现 取巧+思路清晰 但是时间复杂度比较高 可以优化insertGiven a singly linked listLwith integer keys, you are supposed to remove the nodes with duplicated absolute values of the keys. That is, for each valueK, only the first node of which the value or absolute ...

Dijkstra's algorithm is one of the very famous greedy algorithms.It is used for solving the single source shortest path problem which gives the shortest paths from one particular source vertex to all the other vertices of the given graph. It was conceiv..

1001 A+B Format (20 分)PAT甲级