本文共 1584 字,大约阅读时间需要 5 分钟。
package DataDtructure;/** * ClassName: ArrayStack * Company:华中科技大学电气学院 * date: 2019/8/20 14:49 * author: YEXIN * version: 1.0 * since: JDK 1.8 * Description:通过上一节实现的动态数组来实现栈 */public class ArrayStackimplements Stack { Array array; @Override public int getSize() { return array.getSize(); } @Override public boolean isEmpty() { return array.isEmpty(); } @Override public void push(E e) { array.addLast(e); } @Override public E pop() { return array.removeLast(); } @Override public E peek() { return array.getLast(); } public int getCapacity(){ return array.getCapacity(); } public ArrayStack(int capacity){ array = new Array<>(capacity); } public ArrayStack(){ array = new Array<>(); } @Override public String toString(){ StringBuilder res = new StringBuilder(); res.append(String.format("Stack:size = %d,capacity = %d\n",array.getSize(),array.getCapacity())); res.append('['); for(int i = 0 ;i < array.getSize(); i++){ res.append(array.get(i)); if(i != array.getSize() - 1){ res.append(","); } } res.append("] top"); return res.toString(); }}
package DataDtructure;/** * ClassName: Stack * Company:华中科技大学电气学院 * date: 2019/8/23 14:48 * author: YEXIN * version: 1.0 * since: JDK 1.8 * Description: */public interface Stack{ int getSize(); boolean isEmpty(); void push(E e); E pop(); E peek();}
转载地址:http://vchjn.baihongyu.com/