- package org.study.sort;
- import java.util.ArrayList;
- import java.util.LinkedList;
- import java.util.List;
- /**
- * 描述:有一组数(43,14,6,9,3,27,38,19,5等)
- * 排序:将最大的放在第一位,最小放在第二位,剩下的最大的放在第三位,最小的放在第四位,以此类推
- * 输出排序结果
- *
- */
- public class SortNumber {
- public static void main(String[] args) {
- SortNumber sortNumber = new SortNumber();
- Integer[] strs = {43,14,6,9,3,27,38,19,5};
- List<Integer> results = sortNumber.sortStrings(sortNumber.sort(strs));
- for(Integer result : results){
- System.out.print(result + " ");
- }
- }
- private List<Integer> sortStrings(Integer[] strs) {
- List<Integer> lists = new ArrayList<Integer>();
- LinkedList<Integer> results = new LinkedList<Integer>();
- for(Integer str : strs){
- results.push(str);
- }
- while(!results.isEmpty()){
- lists.add(results.pop());
- Integer res = results.pollLast();
- if(res != null){
- lists.add(res);
- }
- }
- return lists;
- }
- //从小到大排序
- private Integer[] sort(Integer[] strs){
- int temp = 0;
- for(int i = 0; i < strs.length - 1; i++){
- for(int j = i + 1; j < strs.length; j++){
- if(strs[i] > strs[j]){
- temp = strs[i];
- strs[i] = strs[j];
- strs[j] = temp;
- }
- }
- }
- return strs;
- }
- }
- //该片段来自于http://www.codesnippet.cn/detail/131220138019.html
来源: http://www.codesnippet.cn/detail/131220138019.html