优先队列: 1 struct node 2 { 3 int u,len; 4 friend bool operator <(node a,node b) 5 { 6 if(a.len!=b.len) 7 return a.le...
package offer7;import common.Stack;/** * 用两个栈实现一个队列 * @author chibozhou */public class Queue<T> {//队列当前大小private int curSize;//队列最大容量private int...