蓝桥杯java试题《洗牌》

package 蓝桥杯java算法训练;

import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;

public class _4洗牌 {

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

StringBuffer strBuff = new StringBuffer();

while (sc.hasNext()) {
String s = sc.next();
//10代表换行键
if(s.equals("10")){
strBuff.append("10 ");
}else{
//10换行，13回车，32空格
char p = s.charAt(0);
if(!(p==10||p==13||p==32)){
strBuff.append(((char)p)+" ");
}
}
}
sc.close();
String str = strBuff.toString();
String[] arr = str.split(" ");

if (str.length() < 52) {
System.out.println("-1");
} else {

List<String> list = new LinkedList<String>();
for (int i = 0; i < arr.length; i++) {
int index = 0;
if (arr[i].equals("J")) {
index = 11;
} else if (arr[i].equals("Q")) {
index = 12;
} else if (arr[i].equals("K")) {
index = 13;
} else {
index = Integer.valueOf(arr[i]);
}

if (list.size() <= index) {
list.add(arr[i]);
} else {
list.add(index, arr[i]);
}
}
for (int i = 0; i < list.size(); i++) {
if (i == list.size() - 1) {
System.out.print(list.get(i));
} else {
System.out.print(list.get(i) + " ");
}

}
}
}
}