基础知识点复习——数组高级应用

现在有两张扑克，左手拿着黑桃10，右手拿着红桃K，要求，换过来输出，最后实现
左手拿着红桃K，右手拿着黑桃10。


冒泡排序


package bdqn;


import java.util.Scanner;


public class Test05 {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int[] score = new int[10];
score[0] = 59;
score[1] = 73;
score[2] = 96;
score[3] = 85;
score[4] = 60;

System.out.println("请输入要插入的成绩：");
score[5] = input.nextInt();
for (int j = 0; j < score.length; j++) {
for (int i = 0; i < score.length-1; i++) {
if (score[i+1]>score[i]) {
int temp = score[i];
score[i] = score[i+1];
score[i+1] = temp;
}
}
}
for (int i : score) {
if(i!=0){
System.out.print(i+"\t");
}
}

}
}


2.Arrays工具
.sort()方法：将指定数组进行升序排列