스택정렬

package com.quiz.stack; import java.util.Arrays; import java.util.Scanner; interface Stack { void pop(); void push(char item); boolean isEmpty(); void clear(); void peek(); } class StackImpl implements Stack { private int inpNum; private int arrNum; private char[] charArr; private String tmp; private char item; public void setTmp(char inpChar) { this.tmp += inpChar; } public StackImpl(int inpNum) { charArr = new char[inpNum]; } @Override public void pop() {//최상위 자료 삭제 for (int i = 0; i < charArr.length; i++) { if (charArr[i] == 0) { int last = i - 1; charArr[last] = 0; arrNum = last; break; } } print(charArr, arrNum); } @Override public void push(char item) {//자료 입력 for (int i = 0; i < charArr.length; i++) { if (charArr[i] == 0) { charArr[i] = item; setTmp(item); arrNum = i + 1; break; } } print(charArr, arrNum); } @Override public boolean isEmpty() { if (charArr.length == 0) { return true; } return false; } @Override public void clear() { Arrays.fill(charArr, (char) 0); arrNum = 0; System.out.println("스택이 초기화 되었습니다."); System.out.println("Stack is empty !"); } @Override public void peek() { for (int i = 0; i < charArr.length; i++) { if (charArr[i] == 0) { int last = i - 1; arrNum = last; break; } System.out.println("Stack elements : " + charArr[i]); } } private void print(char[] charArr, int arrNum) { System.out.print("Stack elements : "); for (int i = 0; i < arrNum; i++) { System.out.print(charArr[i]); } System.out.println(); } } public class StackMain { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print("스택 사이즈를 입력하시오 >> "); int inpNum = sc.nextInt(); Stack stack = new StackImpl(inpNum); System.out.println("입력된 문자 : A"); stack.push('A'); System.out.println("입력된 문자 : B"); stack.push('B'); System.out.println("입력된 문자 : C"); stack.push('C'); System.out.println("삭제된 문자 : C"); stack.pop(); System.out.println("삭제된 문자 : B"); stack.pop(); System.out.println("엿볼려는 문자 : A"); stack.peek(); stack.clear(); } }