摘要:
Dijkstra算法用于求最短路径,有两种实现方式。矩阵和容器。 #include<iostream> #include<vector> using namespace std; const int maxv = 1000, inf = 10000000; //邻接矩阵版 int n, G[maxv 阅读全文
摘要:
Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to ou 阅读全文