特殊排序数组组成最小的数

特殊排序数组组成最小的数

package _2查找与排序2;

import java.util.Arrays;
import java.util.Comparator;

public class 特殊排序数组组成喜小的数 {
public static void main(String[] args) {
	int res =f(new Integer[] {9,8,7,6,5,4,3,1});
	System.out.println(res);
	
}
   private static int f(Integer[]arr) {//封装内部类
	   Arrays.sort(arr,new Comparator<Integer>(){

		@Override
		public int compare(Integer o1, Integer o2) {
			// TODO Auto-generated method stub
			String s1=o1+" "+o2;
			String s2=o2+" "+o1;
			return s1.compareTo(s2);
		}
	   });
	   StringBuilder sb=new StringBuilder();
	   for(int i=0;i<arr.length;i++) {
		  sb.append(arr[i]);
	   }
	   return Integer.parseInt(sb.toString());
   }
}

猜你喜欢

转载自blog.csdn.net/weixin_45952706/article/details/107775487