java数据结构基础:循环链表和栈

public class CircleNode {
	public int data;
	public CircleNode next;
	public CircleNode(int data) {
		this.data = data;
	}
	@Override
	public String toString() {
		return "CircleNode{" + "data=" + data + '}';
	}
}

public class CircleLinkedList {
	public CircleNode head = new CircleNode(0);
	public CircleLinkedList() {
		head.next = head;
	}
	//添加节点
	public void add(CircleNode circleNode) {
		CircleNode temp = head;
		//找到链表最后一个节点
		while (temp.next != head) {
			temp = temp.next;
		}
		temp.next = circleNode;
		circleNode.next = head;
	}
	//删除节点
	public void delete(int data) {
		CircleNode temp = head;
		boolean flag = false;    //标志是否找到待删除节点的前一个节点
		while (true) {
			if (temp.next == head) {
				//已经遍历到链表最后了
				break;
			} else if (temp.next.data == data) {
				//找到待删除节点的前一个节点
				flag = true;
				break;
			}
			temp = temp.next;
		}
		if (flag) {
			temp.next = temp.next.next;
		} else {
			System.out.println("要删除的节点不存在");
		}
	}
	//输出链表
	public void show() {
		//判断链表是否为空
		if (head.next == head) {
			System.out.println("链表为空");
			return;
		}
		CircleNode temp = head.next;
		while (temp != head) {
			System.out.println(temp);
			temp = temp.next;
		}
	}
}

public class ArrayStack {
	private int maxSize;    //数组的最大容量
	private int[] stack;    //存放数据
	private int top = -1;    //栈顶指针
	public ArrayStack(int maxSize) {
		this.maxSize = maxSize;
		stack = new int[this.maxSize];
	}
	//判断栈是否满
	public boolean isFull() {
		return top == maxSize - 1;
	}
	//判断栈是否空
	public boolean isEmpty() {
		return top == -1;
	}
	//入栈
	public void push(int value) {
		//判断是否栈满
		if (isFull()) {
			System.out.println("栈满");
			return;
		}
		top++;
		stack[top] = value;
	}
	//出栈
	public int pop() {
		if (isEmpty()) {
			throw new RuntimeException("栈空");
		}
		int value = stack[top];
		top--;
		return value;
	}
	//输出栈，从栈顶开始显示
	public void show() {
		if (isEmpty()) {
			System.out.println("栈空");
			return;
		}
		for (int i = top; i >= 0; i--) {
			System.out.printf("stack[%d] = %d\n", i, stack[i]);
		}
	}
}