摘要:
struct PriorityQueue{ int Cap; int size; int *data; }; void Print(PriorityQueue* H) { for (int i = 0; i size+1; i++) { printf("%d ", H->data[i]); } printf("\n"); ... 阅读全文
posted @ 2016-04-05 21:37
EazyChange
阅读(705)
评论(0)
推荐(0)
浙公网安备 33010602011771号