Java集合框架——栈数据结构

一、用LinkedList模拟栈

package com.list.demo7;

import java.util.Iterator;
import java.util.LinkedList;

public class LinkedListTest {
	@SuppressWarnings("all")
	public static void main(String[] args) {
		//用LinkedList集合来模拟栈的先进后出
		LinkedList list = new LinkedList();
		
		list.addFirst("demo_1");
		list.addFirst("demo_2");
		list.addFirst("demo_3");
		
		Iterator iterator = list.iterator();
		while(iterator.hasNext()) {
			System.out.println(iterator.next());
			/* demo_3
			 * demo_2
			 * demo_1
			 **/
		}
	}
}

二、栈的创建和测试

//MyStack.java
package com.list.demo7;

import java.util.LinkedList;

@SuppressWarnings("all")
public class MyStack {
	
	LinkedList list = new LinkedList();
		
	//压栈
	public void add(Object obj) {
		list.addFirst(obj);
	}
		
	//弹栈
	public Object pop() {
		return list.removeFirst();
	}
}

// MyStackTest.java
package com.list.demo7;

public class MyStackTest {
	@SuppressWarnings("all")
	public static void main(String[] args) {
		//创建一个栈
		MyStack stack = new MyStack();
		
		//压栈
		stack.add("hello");
		stack.add("world");
		stack.add("java");
		
		//弹栈
		System.out.println((String)stack.pop());  // java
		System.out.println((String)stack.pop());  // world
		System.out.println((String)stack.pop());  // hello
	}
}

三、栈的使用注意事项

• 为了避免在栈空的时候还能再弹栈，应该在弹栈之前判断一下集合是否为空

//MyStack.java 修改代码
	//判断是否栈空
	public boolean isEmpty() {
		return list.isEmpty();
	}

//MyStackTest.java 修改代码
	//弹栈
	while(!stack.isEmpty()) {
		System.out.println((String)stack.pop());
	}