[DataStructures] 스택(Stack) - 스택을 이용해 입력된 문자 뒤집기(Reverse a word)

입력된 문자 뒤집기(Reverse a word)

- 입력된 문자를 스택을 이용해 뒤집어서 출력한다

1. Stack class

1) 변수 정의

private int top; private int stackSize; private char[] stackArr; public Stack(int size){ this.top = -1; this.stackSize = size; this.stackArr = new char[stackSize]; }

2) push(), isStackFull()

public void push(char element)throws Exception{ if(this.isStackFull()){ throw new Exception("Stack is full"); } this.stackArr[++top] = element; } public boolean isStackFull(){ return(top == stackSize -1); }  

3) pop(), isStackEmpty()

public char pop()throws Exception{ if(this.isStackEmpty()){ throw new Exception("Stack is empty"); } return stackArr[top--]; } public boolean isStackEmpty(){ return (top == -1); }  

2. Reverse class

1) reverseWord()

public String reverseWord(String word) throws Exception{ StringBuilder sb = new StringBuilder(); int size = word.length(); Stack st = new Stack(size); for(int i = 0; i<size; i++){ st.push(word.charAt(i)); } while(!st.isStackEmpty()){ sb.append(st.pop()); } return sb.toString(); }  

- Stringbuilder 사용

2) main()

public static void main(String[]args) throws Exception{ ReverseAword aaa=new ReverseAword(); Scanner word = new Scanner(System.in); String a = word.next(); System.out.println(a+">>>>>"+aaa.reverseWord(a)); word.close(); }  

- Scanner를 이용하여 입력받는다