Persistence

Stack 스택으로 reverseString 구현 package adt; // Stack 클래스 public class Stack { private char [] myStack; private int maxSize; private int top = -1; Stack(int s) { this.maxSize = s; myStack = new char [maxSize]; } public void push(char i) { top++; myStack[top] = i; } public char pop() { int old_top = top; top--; return myStack[old_top]; } public boolean isEmpty() { if(top == -1) { return true; } retur..