[Java] 스택(Stack) 코드 구현

후입선출(LIFO, Last-In-First-Out) 방식의 자료구조

 

package ListStackTest;

import java.util.ArrayList;
import java.util.Scanner;

public class stackList{
	Scanner sc = new Scanner(System.in);
	ArrayList<String> al;
	
	
	public stackList(){
		al = new ArrayList<String>();
	}
	public void push(){
			System.out.print(" 입력 : ");
			al.add(sc.next());
			
	}
	public void pop(){
		al.remove(al.size()-1);	// 마지막 것을 빼기위해 -1을 해주자.
		
	}
	public void getTop(){
		System.out.println(al.get(al.size()-1));
	}
	public void listSize(){
		for(int i = 0; i < al.size(); i++){
			System.out.print(al.get(i));
		}
	}
}

 

실행

package ListStackTest;

public class mainClass {

	public static void main(String[] args) {
		stackList cls = new stackList();
		
		cls.push();
		cls.push();
		cls.push();
		cls.getTop();
		cls.pop();
		cls.listSize();

	}

}