只利用一个额外栈实现栈的排序

最新推荐文章于 2022-05-15 22:08:24 发布

沙漠一只雕得儿得儿

最新推荐文章于 2022-05-15 22:08:24 发布

阅读量411

点赞数

分类专栏：面试相关算法--栈和队列文章标签：栈排序

本文链接：https://blog.csdn.net/cpcpcp123/article/details/53161060

版权

面试相关算法--栈和队列专栏收录该内容

9 篇文章 0 订阅

订阅专栏

package chapter01_stack_and_queue;

import java.util.Stack;

public class _05_StackSortStack {
	public static void sortStackByStack(Stack<Integer> stack) {
		Stack<Integer> stackHelp = new Stack<Integer>();
		while(!stack.isEmpty()) {
			int cur = stack.pop();
			while(!stackHelp.isEmpty() && stackHelp.peek() < cur) {
				stack.push(stackHelp.pop());
			}
			stackHelp.push(cur);
		}
		while (!stackHelp.isEmpty()) {
			stack.push(stackHelp.pop());
		}
	}
	
	public static void main(String[] args) {
		Stack<Integer> stack = new Stack<Integer>();
		stack.push(3);
		stack.push(1);
		stack.push(6);
		stack.push(2);
		stack.push(5);
		stack.push(4);
		sortStackByStack(stack);
		System.out.println(stack.pop());
		System.out.println(stack.pop());
		System.out.println(stack.pop());
		System.out.println(stack.pop());
		System.out.println(stack.pop());
		System.out.println(stack.pop());
	}
}