1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79
| package main
const maxSize = 10
type StackDeque struct { pushStack *Stack popStack *Stack flag bool }
func (s *StackDeque) exchange(from, to *Stack) { to.Clean() for true { if v, ok := from.Pop(); ok { to.Push(v) } else { break } } s.flag = !s.flag }
func (s *StackDeque) Push(val int) bool { if !s.flag { s.exchange(s.popStack, s.pushStack) } return s.pushStack.Push(val) }
func (s *StackDeque) Pop() (int, bool) { if s.flag { s.exchange(s.pushStack, s.popStack) } return s.popStack.Pop() }
type Stack struct { arr [maxSize]int size int }
func (s *Stack) isFull() bool { if s.size == maxSize { return true } return false }
func (s *Stack) isEmpty() bool { if s.size == 0 { return true } return false }
func (s *Stack) Push(val int) bool { if s.isFull() { return false } s.arr[s.size] = val s.size++ return true }
func (s *Stack) Pop() (int, bool) { if s.isEmpty() { return 0, false } val := s.arr[s.size-1] s.size-- return val, true }
func (s *Stack) Clean() { s.size = 0 }
|