扑克牌数组排序Pro

前面那个方法太傻太繁琐,,现改进如下

public class SortPokerPro{
	public static void main(String[] args){
		String[] str = {"2","Q","J","K","10","9","8","7","6","5","4","3","A"} ;
		for(int i = 0; i < str.length - 1; i++){
			for(int j = 0; j < str.length - 1 - i; j++){
				int value1 = change(str[j]) ;
				int value2 = change(str[j + 1]) ;
				if(value1 > value2){
					String temp = str[j] ;
					str[j] = str[j + 1] ;
					str[j + 1] = temp ;
				}
			}
		}
		for(String s : str) System.out.print( s + " ") ;
	}
	public static int change(String str){
		if(str == "J") return 11 ;
		if(str == "Q") return 12 ;
		if(str == "K") return 13 ;
		if(str == "A") return 14 ;
		if(str == "2") return 15 ;
		else return Integer.parseInt(str) ;
	}
}