fw 3.6 - stack sort- java version - 2013年12月16日23:23:32
2013-12-17 12:22
363 查看
package test_kepler; import java.util.Stack; public class StackSort { Stack<Integer> o_stack; Stack<Integer> b_stack; Stack<Integer> r_stack; public StackSort() { o_stack = new Stack<Integer>(); b_stack = new Stack<Integer>(); r_stack = new Stack<Integer>(); } public void push(int i) { o_stack.push(i); } public int pop() { return o_stack.pop(); } //o_stack<->r_stack; public void sort_stack() { int i = 0; while(o_stack.size()!= 0 || b_stack.size()!= 0) { ++i; int min = 0; if(o_stack.size()!=0) {//o_stack->b_stack; min = o_stack.pop(); while(o_stack.size()!=0) { int t = o_stack.pop(); if(t>min) { b_stack.push(t); } else { b_stack.push(min); min = t; } } r_stack.push(min); } else {//b_stack->o_stack if(b_stack.size()!=0) { min = b_stack.pop(); while(b_stack.size()!=0) { int t = b_stack.pop(); if(t>min) { o_stack.push(t); } else { o_stack.push(min); min = t; } } r_stack.push(min); } } } o_stack=r_stack; } // standard solution public static Stack<Integer> sort(Stack<Integer> s) { Stack<Integer> r = new Stack<Integer>(); while(!s.isEmpty()) { int tmp = s.pop(); while(!r.isEmpty() && r.peek() > tmp) { s.push(r.pop()); } r.push(tmp); } return r; } public static void main(String[] args) { StackSort ss = new StackSort(); int a[] = {1,23,-2,-43,-243,-33,3332}; for(int i = 0;i<7;++i) { ss.push(a[i]); } ss.sort_stack(); for(int i = 0;i<7;++i) { System.out.println(ss.pop()); } } }
相关文章推荐
- fw - dfs: stack/recursive ; bfs : stack/recursive- java version - 2013年12月20日18:37:18
- fw 3.5 -2013年12月16日21:02:12 - two stacks make a queue- java version -
- fw - pre_order_traverse - 2013年12月17日13:36:58 - java version
- FW-binary - tree - with id and sibling connected - java version 2013年12月18日1:21
- FWNX-4,.5 JAVA VERSION - SUCCESS OF IN_ORDER_TRAVERSE
- FW - floor and ceilingn - java version
- fw-3.5 - queue by 2 stacks - C++ version - 2013年12月16日21:20:06
- FW-stack sort- 12/17/2013 C++ version
- [CareerCup] 3.6 Sort Stack 栈排序
- Sun Java Web Server version 7.0 update 7 remote stack overflow exploit
- fw-2013年12月16日16:54:13 - haino tower via stack -java
- quick sort java version
- java.lang.UnsupportedClassVersionError: PR/Sort : Unsupported major.minor version 52.0
- bubble sort in linked list....(java version)
- FW-4.2- decide whether the two nodes have circle - JAVA VERSION - 2013年12月20日20:22:25
- java version: Simple Selection Sort
- fw12013年12月13日1:17:54 - multi-stack -java
- Project facet Java version 1.8 is not supported 解决方案
- JDK版本问题Exception in thread "main" java.lang.UnsupportedClassVersionError:
- JDK安装多个版本出现Java -version和你配置的环境变量的jdk版本不一致的问题