【算法】程序猿不写代码是不对的10

来源：互联网发布：java培训机构比较好编辑：程序博客网时间：2024/04/29 14:32

package com.kingdz.algorithm.time201701;/** * 栈的实现 *  * @author kingdz *  */public class Algo24 {// 栈大小private static final int MAXLEN = 10;/** * 获取栈顶元素 *  * @param s * @return */String peek(Stack s) {if (stackIsEmpty(s)) {System.out.println("栈已空");return null;}int index = s.getTop() - 1;return s.getData()[index];}/** * 出栈 *  * @param s * @return */String pop(Stack s) {if (stackIsEmpty(s)) {System.out.println("栈已空");return null;}s.setTop(s.getTop() - 1);return s.getData()[s.getTop()];}/** * 入栈 *  * @param s * @return */int push(Stack s, String data) {if (stackIsFull(s)) {System.out.println("栈已满");return -1;}s.getData()[s.getTop()] = data;s.setTop(s.getTop() + 1);return 1;}/** *判断栈是否已满 *  * @param s * @return */boolean stackIsFull(Stack s) {return s.getTop() >= MAXLEN;}/** * 清空栈 */void stackClear(Stack s) {s.setTop(0);}/** * 判断栈是否为空 *  * @param s * @return */boolean stackIsEmpty(Stack s) {return s.getTop() == 0;}/** * 初始化 *  * @return */Stack init() {Stack s = new Stack();s.setData(new String[MAXLEN]);s.setTop(0);return s;}class Stack {private String[] data;private int top;public String[] getData() {return data;}public void setData(String[] data) {this.data = data;}public int getTop() {return top;}public void setTop(int top) {this.top = top;}}}

0 0