//Bag的实现
package Algorithms;
import java.util.Iterator;
import java.util.NoSuchElementException;
import edu.princeton.cs.algs4.StdIn;
import edu.princeton.cs.algs4.StdOut;
public class P98_Bag<Item> implements Iterable<Item> {
private Node<Item> first; //链表的首结点
private int n;
private static class Node<Item>{
//定义了结点的嵌套类
private Item item;
private Node<Item> next;
}
public P98_Bag(){
first = null;
n = 0;
}
public boolean isEmprty(){
return first == null;
}
public int size(){
return n;
}
public void add(Item item){
//和stack的push()方法完全相同
Node<Item> oldfirst = first;
first = new Node<Item>();
first.item = item;
first.next = oldfirst;
n++;
}
public Iterator<Item> iterator(){
return new ListIterator<Item>(first);
}
private class ListIterator<Item> implements Iterator<Item>{
private Node<Item> current;
public ListIterator(Node<Item> first){
current = first;
}
@Override
public boolean hasNext() {
// TODO Auto-generated method stub
return current != null;
}
@Override
public Item next() {
// TODO Auto-generated method stub
if (!hasNext()){
throw new NoSuchElementException();
}
Item item = current.item;
current = current.next;
return item;
}
@Override
public void remove() {
// TODO Auto-generated method stub
throw new UnsupportedOperationException();
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
P98_Bag<String> bag = new P98_Bag<String>();
while (!StdIn.isEmpty()){
String item = StdIn.readString();
bag.add(item);
}
StdOut.println("size of bag = " + bag.size());
for (String s : bag) {
StdOut.println(s);
}
}
}
Bag的实现
最新推荐文章于 2020-07-09 18:57:32 发布