首页 > 代码库 > CTCI 3.6
CTCI 3.6
Write a program to sort a stack in ascending order (with biggest items on top). You may use at most one additional stack to hold items, but you may not copy the elements into any other data structure (such as an array).The stack supports the following operations: push, pop, peek, and isEmpty.
/*Use bubble sort, one stack used as buffer as well as to store the sorted elements. Each time find the smallest element exist in the other stack and push it in after pop the buffer out.*/import java.util.*;public class SortStack { Stack<Integer> stack2 = new Stack<Integer>(); public void sort(Stack<Integer> stack1) { int min = 0, temp = 0, cnt = 0; while(stack1.isEmpty() == false) { stack2.push(stack1.pop()); cnt++; } for(int i = 0; i < cnt; i++) { min = stack2.pop(); while(stack2.isEmpty() == false) { temp = stack2.pop(); if(temp >= min) { stack1.push(temp); } else { stack1.push(min); min = temp; } } for(int j = 0; j < cnt-i-1; j++) { stack2.push(stack1.pop()); } stack1.push(min); } } public void print(Stack<Integer> stack) { while(stack.isEmpty() == false) { System.out.print(stack.pop() + " "); } System.out.print(""); } public static void main(String[] args) { Stack<Integer> stack1 = new Stack<Integer>(); stack1.push(10); stack1.push(8); stack1.push(18); stack1.push(8); stack1.push(1); SortStack ss = new SortStack(); ss.sort(stack1); ss.print(stack1); }}
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。