原文链接
下压栈
C语言实现
Java实现
package cn.ywrby.data.structure;
import edu.princeton.cs.algs4.StdOut;
import edu.princeton.cs.algs4.StdRandom;
import java.util.Iterator;
public class ResizingArrayStack<Item> implements Iterable<Item> {
private Item[] data = (Item[]) new Object[1];
private int N = 0;
public boolean isEmpty() {
return N == 0;
}
public int size() {
return N;
}
public void resize(int max) {
Item[] temp = (Item[]) new Object[max];
for (int i = 0; i < N; i++) {
temp[i] = data[i];
}
data = temp;
}
public void push(Item item) {
if (N == data.length) {
resize(2 * data.length);
}
data[N++] = item;
}
public Item pop() {
Item item = data[--N];
data[N] = null;
if (N > 0 && N <= data.length / 4) {
resize(data.length / 2);
}
return item;
}
@Override
public Iterator<Item> iterator() {
return new ReverseArrayIterator();
}
private class ReverseArrayIterator implements Iterator<Item> {
private int i = N;
@Override
public boolean hasNext() {
return i > 0;
}
@Override
public Item next() {
return data[--i];
}
public void remove() {
}
}
public static void main(String[] args) {
ResizingArrayStack<Double> array=new ResizingArrayStack<Double>();
for (int i=0;i<10;i++) {
double num=StdRandom.uniform();
StdOut.println(num);
array.push(num);
}
StdOut.println("-------------------------------");
Iterator iterator=array.iterator();
while(iterator.hasNext()) {
StdOut.println(iterator.next());
}
}
}
链表
C语言实现
Java实现
package cn.ywrby.data.structure;
import java.util.Iterator;
import edu.princeton.cs.algs4.StdOut;
import edu.princeton.cs.algs4.StdRandom;
public class Stack<Item> implements Iterable<Item> {
private Node first;
private int N;
private class Node{
Item item;
Node next;
}
public boolean isEmpty() {
return N==0;
}
public int size() {
return N;
}
public void push(Item data) {
Node oldFirst=first;
first=new Node();
first.item=data;
first.next=oldFirst;
N++;
}
public Item pop() {
Node oldFirst=first;
first=first.next;
N--;
return oldFirst.item;
}
@Override
public Iterator<Item> iterator() {
return new StackIterator();
}
private class StackIterator implements Iterator<Item>{
private Node current=first;
@Override
public boolean hasNext() {
return current!=null;
}
@Override
public Item next() {
Item data=current.item;
current=current.next;
return data;
}
public void remove() {}
}
public static void main(String[] args) {
Stack<Double> stack=new Stack<Double>();
for(int i=0;i<10;i++) {
double num=StdRandom.uniform();
StdOut.println(num);
stack.push(num);
}
System.out.println("-----------------------------");
Iterator iterator=stack.iterator();
while(iterator.hasNext()) {
StdOut.println(iterator.next());
}
}
}
队列
C语言实现
Java实现
package cn.ywrby.data.structure;
import java.util.Iterator;
import edu.princeton.cs.algs4.StdOut;
import edu.princeton.cs.algs4.StdRandom;
public class Queue<Item> implements Iterable<Item> {
private Node first;
private Node last;
private int N;
private class Node {
Item item;
Node next;
}
public boolean isEmpty() {
return N == 0;
}
public int size() {
return N;
}
public void enqueue(Item data) {
Node oldLast = last;
last = new Node();
last.item = data;
last.next = null;
if (isEmpty()) {
first = last;
} else {
oldLast.next = last;
}
N++;
}
public Item dequeue() {
Node oldFirst = first;
first = oldFirst.next;
if (isEmpty()) {
last = null;
}
N--;
return oldFirst.item;
}
@Override
public Iterator<Item> iterator() {
return new QueueIterator();
}
private class QueueIterator implements Iterator<Item>{
private Node current=first;
@Override
public boolean hasNext() {
return current!=null;
}
@Override
public Item next() {
Item data=current.item;
current=current.next;
return data;
}
public void remove() {}
}
public static void main(String[] args) {
Queue<Double> queue=new Queue<Double>();
for(int i=0;i<10;i++) {
double num=StdRandom.uniform();
StdOut.println(num);
queue.enqueue(num);
}
System.out.println("-----------------------------");
Iterator iterator=queue.iterator();
while(iterator.hasNext()) {
StdOut.println(iterator.next());
}
}
}
背包
package cn.ywrby.data.structure;
import java.util.Iterator;
public class Bag<Item> implements Iterable<Item> {
private Node first;
private int N;
private class Node {
Item item;
Node next;
}
public boolean isEmpty() {
return N==0;
}
public int size() {
return N;
}
public void push(Item data) {
Node oldFirst=first;
first=new Node();
first.item=data;
first.next=oldFirst;
N++;
}
@Override
public Iterator<Item> iterator() {
return new BagIterator();
}
private class BagIterator implements Iterator<Item>{
private Node current=first;
@Override
public boolean hasNext() {
return current!=null;
}
@Override
public Item next() {
Item data=current.item;
current=current.next;
return data;
}
public void remove() {}
}
public static void main(String[] args) {
}
}