Cacher is the code snippet organizer for pro developers

func nextGreaterElement(findNums []int, nums []int) []int {
    if len(nums) == 0 {
		return []int{}
	}
	result := make([]int, 0)
	m := make(map[int]int)
	st := &Stack{}
	st.Push(nums[0])
	for _, n := range nums[1:] {
		for st.Len() > 0 && n > st.Peek().(int) {
			pop, _ := st.Pop()
			m[pop.(int)] = n
		}
		st.Push(n)
	}
	for _, n := range findNums {
		if v, ok := m[n]; ok {
			result = append(result, v)
		} else {
			result = append(result, -1)
		}
	}
	return result
}
type Stack struct {
	data []interface{}
}
func (this *Stack) Len()int {
	return len(this.data)
}

func (this *Stack) Push(i interface{}) {
	this.data = append([]interface{}{i}, this.data...)
}
func (this *Stack) Peek() interface{} {
	return this.data[0]
}
func (this *Stack) Pop() (interface{}, bool) {
	if len(this.data) == 0 {
		return nil, false
	}
	i := this.Peek()
	this.data = this.data[1:]
	return i, true
}