Go-用一个栈实现另一个栈的排序

Love The Way You Lie 2022-09-09 12:59 149阅读 0赞

代码片段如下：

/*
     *                    .::::.
     *                  .::::::::.
     *                 :::::::::::
     *             ..:::::::::::'
     *           '::::::::::::'
     *             .::::::::::
     *        '::::::::::::::..
     *             ..::::::::::::.		Utils:用一个栈实现另一个栈的排序
     *           ``::::::::::::::::		Author:崔金朋
     *            ::::``:::::::::'        .:::.
     *           ::::'   ':::::'       .::::::::.
     *         .::::'      ::::     .:::::::'::::.
     *        .:::'       :::::  .:::::::::' ':::::.
     *       .::'        :::::.:::::::::'      ':::::.
     *      .::'         ::::::::::::::'         ``::::.
     *  ...:::           ::::::::::::'              ``::.
     * ```` ':.          ':::::::::'                  ::::..
     *  		           '.:::::'          			':'````..
     */
    
    package main
    
    import (
    	"errors"
    	"fmt"
    )
    
    type SortStack struct {
    	Stack     []int
    	helpStack []int
    }
    
    // 用一个栈实现另一个栈的排序
    func (s *SortStack) SortStackByStack() ([]int, error) {
    	stackLen := len(s.Stack)
    	if stackLen == 0 {
    		return nil, errors.New("参数为空")
    	}
    
    	for len(s.Stack) > 0 {
    		currNum, _ := s.SortPop()
    		helpPeek, _ := s.SortHelpPeek()
    		for len(s.helpStack) > 0 && helpPeek > currNum {
    			helpNum, _ := s.SortHelpPop()
    			s.SortPush(helpNum)
    		}
    
    		s.SortHelPush(currNum)
    	}
    
    	fmt.Println(s.helpStack)
    	for len(s.helpStack) > 0 {
    		helpNum, _ := s.SortHelpPop()
    		s.SortPush(helpNum)
    	}
    
    	return s.Stack, nil
    }
    
    func (s *SortStack) SortPop() (int, error) {
    	length := len(s.Stack)
    	var item int
    	if length == 0 {
    		return 0, errors.New("数据不存在")
    	} else if length == 1 {
    		item = s.Stack[0]
    		s.Stack = []int{}
    	} else {
    		item = s.Stack[length-1]
    		s.Stack = s.Stack[0 : length-1]
    	}
    
    	return item, nil
    }
    
    func (s *SortStack) SortHelpPop() (int, error) {
    	length := len(s.helpStack)
    	var item int
    	if length == 0 {
    		return 0, errors.New("数据不存在")
    	} else if length == 1 {
    		item = s.helpStack[0]
    		s.helpStack = []int{}
    	} else {
    		item = s.helpStack[length-1]
    		s.helpStack = s.helpStack[0 : length-1]
    	}
    
    	return item, nil
    }
    
    func (s *SortStack) SortHelpPeek() (int, error) {
    	length := len(s.helpStack)
    	var item int
    	if length == 0 {
    		return 0, errors.New("数据不存在")
    	} else if length == 1 {
    		item = s.helpStack[0]
    	} else {
    		item = s.helpStack[length-1]
    	}
    
    	return item, nil
    }
    
    func (s *SortStack) SortPush(item int) (bool, error) {
    	if item == 0 {
    		return false, errors.New("数据不能为空")
    	}
    
    	s.Stack = append(s.Stack, item)
    	return true, nil
    }
    
    func (s *SortStack) SortHelPush(item int) (bool, error) {
    	if item == 0 {
    		return false, errors.New("数据不能为空")
    	}
    
    	s.helpStack = append(s.helpStack, item)
    	return true, nil
    }