T84
package com.amoscloud.newcoder.easy; import java.util.Arrays; import java.util.Scanner; /** * Created with IntelliJ IDEA. * Author: Amos * E-mail: amos@amoscloud.com * Date: 2021/12/22 * Time: 9:07 * Description: 95% */ public class Main103 { /* 小组中每位都有一张卡片 卡片是6位以内的正整数 将卡片连起来可以组成多种数字 计算组成的最大数字 输入描述: ","分割的多个正整数字符串 不需要考虑非数字异常情况 小组种最多25个人 输出描述: 最大数字字符串 示例一 输入 22,221 输出 22221 示例二 输入 4589,101,41425,9999 输出 9999458941425101 */ public static void main(String[] args) { Scanner in = new Scanner(System.in); String nums = in.nextLine(); in.close(); StringBuilder builder = new StringBuilder(); Arrays.stream(nums.split(",")) .sorted((s1, s2) -> { char[] v1 = s1.toCharArray(); char[] v2 = s2.toCharArray(); int len1 = v1.length; int len2 = v2.length; if (len1 == len2) { return s2.compareTo(s1); } int min = Math.min(len1, len2); for (int i = 0; i < min; i++) { char c1 = v1[i]; char c2 = v2[i]; if (c1 != c2) { return c2 - c1; } } if (len1 > len2) { return v1[0] - v1[min]; } else { return v2[min] - v2[0]; } }) .forEach(builder::append); System.out.println(builder); } }
package 德科;
import java.util.Arrays;
import java.util.Scanner;
/**
* FileName: 德科.T84MyAnswer
* Author: wp
* Date: 2022/6/4 0004 18:49
* Description:
*/
public class T84MyAnswer {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String nums = in.nextLine();
in.close();
String[] arr = nums.split(",");
StringBuilder sb = new StringBuilder();
Arrays.stream(arr).sorted((s1,s2)->{
return s1.length()==s2.length()?s2.compareTo(s1):(s2+s1).compareTo(s1+s2);
}).forEach(sb::append);
System.out.println(sb);
System.out.println(sb.toString().equals("9999458941425101"));
}
}