算法思想:判断m,n两个数组合的大小关系用:
(1)求出m,n对应的几位数
(2)然后判断mn 与nm的大小关系进行排序即可
public class Main {
public static void main(String[] args) {
int[] n = {3,32,321};
System.out.println(maxValue(n));
}
public static int maxValue(int[] n){
int temp;
for(int i = n.length-1;i >= 0;i--){
for(int j = 0;j < i;j++){
int n1 = String.valueOf(n[j]).length();//求n[j]的位数
int n2 = String.valueOf(n[j+1]).length();//求n[j+1]的位数
int p = Integer.parseInt(String.valueOf(n[j])+String.valueOf(n[j+1]));//n[j]n[j+1]
int q = Integer.parseInt(String.valueOf(n[j+1]+String.valueOf(n[j])));//n[j+1]n[j]
if(p > q){//按从小到大的顺序排序
temp = n[j+1];
n[j+1] = n[j];
n[j] = temp;
}
}
}
StringBuffer sb = new StringBuffer();
for(int i = 0;i < n.length;i++){
sb.append(n[i]);
}
return Integer.parseInt(sb.toString());
}
}