노력과 삽질 퇴적물

1. 스택 ①스택 선언 ②push(), 삽입 ③pop(), 삭제 Algorithm size(): return t +1 //인덱스가 0부터 시작 Algorithm isEmpty(): return (t < 0) Algorithm top(): if isEmpty() then throw a StackEmptyException return S[t] Algorithm push(o): if size() = N then throw a StackFullException t ← t + 1 S[t] ← o Algorithm pop(): if isEmpty() then throw a StackEmptyException e ← S[t] S[t] ← null t ← t-1 return e 1) 구현12345678910111213..