Java中自定义Stack的Demo

import java.lang.reflect.Field;

public class LinkedStack<T> {

	class Node<T> {
		/**
		 * value storage object
		 */
		T item;
		/**
		 * next node
		 */
		Node<T> next;

		/**
		 * default constructor
		 */
		Node() {
			item = null;
			next = null;
		}

		/**
		 * full-param constructor
		 * 
		 * @param item
		 * @param next
		 */
		Node(T item, Node<T> next) {
			this.item = item;
			this.next = next;
		}

		@Override
		public String toString() {
			return item == null ? null : item.toString();
		}
		/**
		 * judge if linked stack reached its end
		 * 
		 * @return
		 */
		boolean end() {
			return item == null && next == null;
		}
	}

	/**
	 * override toString
	 */
	@Override
	public String toString() {
		StringBuilder stringBuilder = new StringBuilder("[");
		Node<T> temp = top;
		while( ! temp.end() ){
			stringBuilder.append(temp.toString()+",");
			temp = temp.next;
		}
		int length = stringBuilder.length();
		if( stringBuilder.indexOf(",", length-1) > -1 ){
			stringBuilder.deleteCharAt(length-1);
		}
		stringBuilder.append("]");
		return stringBuilder.toString();
	}
	/**
	 * push operation
	 * 
	 * @param item
	 */
	public void push(T item) {
		Node<T> insertNode = new Node<>(item, top);
		top = insertNode;
	}

	/**
	 * pop operation
	 * 
	 * @return
	 */
	public T pop() {
		T item = top.item;
		if (!top.end()) {
			top = top.next;
		}
		return item;
	}
	/**
	 * peek
	 * @return
	 */
	public T peek(){
		T item = top.item;
		return item;
	}

	/**
	 * top element as leading clue of the linked stack
	 */
	private Node<T> top = new Node<>();

}

class TestLinkedStack {
	public static void main(String[] args) {
		LinkedStack<User> stack = new LinkedStack<>();
		stack.push(new User("Victor", "Male", 24));
		stack.push(new User("Lee", "Male", 24));
		User top = stack.peek();
		top = null;
		System.out.println( stack );
	}
}

class User {
	public String name;
	public String gender;
	public int age;
	public User(String name, String gender, int age) {
		super();
		this.name = name;
		this.gender = gender;
		this.age = age;
	}
	@Override
	public String toString() {
		StringBuilder stringBuilder = new StringBuilder("{");
		Field[] fields = this.getClass().getDeclaredFields();
		for(Field field : fields) {
			field.setAccessible(true);
			String fieldName = field.getName();
			try {
				stringBuilder.append(fieldName+":"+field.get(this)+",");
			} catch (IllegalArgumentException e) {
				e.printStackTrace();
			} catch (IllegalAccessException e) {
				e.printStackTrace();
			}
		}
		int length = stringBuilder.length();
		if( stringBuilder.indexOf(",", length-1) > -1 ){
			stringBuilder.deleteCharAt(length-1);
		}
		stringBuilder.append("}");
		return stringBuilder.toString();
	}
	public static void main(String[] args) {
		User user = new User("Victor", "Male", 24);
		System.out.println(user);
	}
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值