Go-仅用递归函数和栈操作，逆序一个栈

我不是女神ヾ 2022-09-09 12:59 150阅读 0赞

代码片段如下：

/*
     *                    .::::.
     *                  .::::::::.
     *                 :::::::::::
     *             ..:::::::::::'
     *           '::::::::::::'
     *             .::::::::::
     *        '::::::::::::::..
     *             ..::::::::::::.		Utils:仅用递归函数和栈操作，逆序一个栈
     *           ``::::::::::::::::		Author:崔金朋
     *            ::::``:::::::::'        .:::.
     *           ::::'   ':::::'       .::::::::.
     *         .::::'      ::::     .:::::::'::::.
     *        .:::'       :::::  .:::::::::' ':::::.
     *       .::'        :::::.:::::::::'      ':::::.
     *      .::'         ::::::::::::::'         ``::::.
     *  ...:::           ::::::::::::'              ``::.
     * ```` ':.          ':::::::::'                  ::::..
     *  		           '.:::::'          			':'````..
     */
    
    package main
    
    import (
    	"errors"
    )
    
    type ReverseStack struct {
    	reverseStack []interface{}
    }
    
    // 获取并且移除最后一个元素
    func (r *ReverseStack) GetAndRemoveLastElement() (interface{}, error) {
    	length := len(r.reverseStack)
    	if length == 0 {
    		return nil, errors.New("栈为空")
    	}
    
    	element, elementErr := r.ReversePop()
    	if len(r.reverseStack) == 0 || elementErr != nil {
    		return element, nil
    	}
    
    	lastElement, _ := r.GetAndRemoveLastElement()
    	_, reverseErr := r.ReversePush(element)
    	return lastElement, reverseErr
    }
    
    // 逆序一个栈
    func (r *ReverseStack) Reverse() ([]interface{}, error) {
    	length := len(r.reverseStack)
    	if length == 0 {
    		return []interface{}{}, errors.New("参数为空")
    	}
    
    	lastElement, _ := r.GetAndRemoveLastElement()
    	r.reverseStack, _ = r.Reverse()
    	r.ReversePush(lastElement)
    	return r.reverseStack, nil
    }
    
    func (r *ReverseStack) ReversePop() (interface{}, error) {
    	length := len(r.reverseStack)
    	var item interface{}
    	if length == 0 {
    		return 0, errors.New("数据不存在")
    	} else if length == 1 {
    		item = r.reverseStack[0]
    		r.reverseStack = []interface{}{}
    	} else {
    		item = r.reverseStack[length-1]
    		r.reverseStack = r.reverseStack[0 : length-1]
    	}
    
    	return item, nil
    }
    
    func (r *ReverseStack) ReversePush(item interface{}) (bool, error) {
    	if item == nil {
    		return false, errors.New("数据不能为空")
    	}
    
    	r.reverseStack = append(r.reverseStack, item)
    	return true, nil
    }