算法1.3—背包, 队列, 栈
简单的非变长背包
import edu.princeton.cs.algs4.Out;
import edu.princeton.cs.algs4.StdOut;
public class Bag<Item> {
private Item[] items;
private int pos=0;
public Bag(int size){
items = (Item[]) new Object[size];
}
void add(Item item){
if(pos<=items.length)[......]