清华大佬耗费三个月吐血整理的几百G的资源,免费分享!....>>>
冒泡排序算法
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 | import java.util.Arrays; import java.util.List; import java.util.Scanner; public class BubbleSort { public static void main(String[] args) { Scanner sc = new Scanner(System.in); String line = sc.nextLine(); String[] split = line.split( " " ); List<String> list = Arrays.asList(split); for ( int i = 0 ; i < list.size(); i++) { String s = list.get(i); if ( " " .equals(s)) { list.remove(i); } } int [] ints = new int [list.size()]; for ( int i = 0 ; i < ints.length; i++) { ints[i] = Integer.parseInt(list.get(i)); } for ( int i = 0 ; i < ints.length; i++) { for ( int j = 1 ; j < ints.length-i; j++) { int temp = ints[j- 1 ]; if (temp > ints[j]) { ints[j- 1 ]=ints[j]; ints[j] = temp; } } } for ( int i = 0 ; i < ints.length- 1 ; i++) { int anInt = ints[i]; System.out.print(String.format( "%d " , anInt)); } System.out.println(ints[ints.length - 1 ]); } } |