'Algorithm&DataStructures/Stack'에 해당되는 글 6건

 스택(Stack) - 동적스택(dynamicStack)

- 스택 오버플로우(stack overflow)날 경우 스택 사이즈를 동적으로 늘린다

1. 구현

1) 변수 초기화

private int top; private int[] stackArray; private int stackSize; public DynamicStack(int size){ this.top = -1; this.stackSize = size; this.stackArray = new int[stackSize]; }

2) push() and isStackFull()

public void push(int element)throws Exception{ if(this.isStackFull()){ System.out.println("Stack is full, We increase a stack size"); this.increaseCapacity(); } System.out.println("adding:"+element); this.stackArray[++top] = element; } public boolean isStackFull(){ return (stackSize-1 == top); }  

3) increaseCapacity()

public void increaseCapacity(){ int[] newArray = new int[stackSize *2]; for(int i = 0; i<stackArray.length;i++){ newArray[i] = this.stackArray[i]; } this.stackArray = newArray; this.stackSize = this.stackSize *2; }  

- 새로운 배열을 만들어 기존의 값을 넣는다

- 기존 배열을 새로운 배열로 변경한다

4) pop() and isStackEmpty()

public int pop()throws Exception{ if(this.isStackEmpty()){ throw new Exception("Stack is empty"); } int entity = stackArray[top--]; System.out.println("poping:"+entity); return entity; } public boolean isStackEmpty(){ return ( top == -1); }  

5) peek()

public int peek(){ System.out.println("peek:"+stackArray[top]); return stackArray[top]; }  

6) main()

public static void main(String[]args){ DynamicStack s1 = new DynamicStack(3); try{ s1.push(1); s1.push(2); s1.push(3); s1.push(4); s1.push(5); s1.pop(); s1.peek(); s1.pop(); s1.push(6); s1.push(7); s1.push(8); s1.push(9); }catch(Exception e){ System.out.println(e.getMessage()); } }  

스택(Stack) - 간단자바예제(Simple in java)

1. 스택(Stack)

- Push : 탑에 객체가 쌓인다(add)

- Pop : 탑에 객체가 없어진다(remove)

- Peek : 탑의 값을 가져온다

2. 구현

1) 변수 초기화

private int stackSize; private int top; private int[] stackArray; public SimpleImplementation(int size){ this.stackSize = size; this.top = -1; this.stackArray= new int[stackSize]; }

2) push() and isStackFull()

public void push(int element) throws Exception{ if(this.isStackFull()){ throw new Exception("Stack is full"); } System.out.println("pushing:"+element); this.stackArray[++top] = element; } public boolean isStackFull(){ if(top == stackSize - 1){ return true; }else{ return false; } }  

3). pop() and isStackEmpty()

public int pop() throws Exception{ if(this.isStackEmpty()){ throw new Exception("Stack is empty"); } int element = stackArray[top--]; System.out.println("poping:"+element); return element; } public boolean isStackEmpty(){ if(top == -1){ return true; }else{ return false; } }  

4) peek()

public int peek(){ System.out.println("peek:"+stackArray[top]); return stackArray[top]; }  

5) main()

public static void main(String[]args){ SimpleImplementation stack = new SimpleImplementation(3); try{ stack.push(1); stack.push(2); stack.push(3); stack.pop(); stack.push(4); stack.peek(); stack.pop(); stack.pop(); stack.pop(); stack.pop(); }catch(Exception e){ System.out.println(e.getMessage()); } }