golang刷leetcode 技巧（49）栈的压入、弹出序列

func validateStackSequences(pushed []int, popped []int) bool {
    var s stack
    j:=0
    for i:=0;i<len(pushed);i++{
        s.push(pushed[i])
         for !s.empty() && s.top()==popped[j]{
             s.pop()
             j++
            //if j<len(popped){
            // fmt.Println("inner:",s.data,i,j,popped[j],s.top())
            //}
         }
         //if j<len(popped){
         //fmt.Println(s.data,i,j,popped[j])
         //}
    }
    return s.empty() && j==len(popped)
}

type stack struct{
    data []int
}

func (s *stack )push(v int){
   s.data=append(s.data,v)
}

func (s *stack)pop()int{
   v:=s.data[len(s.data)-1]
   s.data=s.data[:len(s.data)-1]
   return v
}

func(s*stack)top()int{
    return s.data[len(s.data)-1]
}

func (s*stack)empty()bool{
    return len(s.data)==0
}