CodeSprout 官方2026/10/04 00:19

官方解答 · 置頂Java

官方解答｜展場標籤排序

CodeSprout 官方解答 · 題意分析、解題步驟與完整參考程式

import java.util.*;

public class Solution {
    private static int key(String word) {
        return word.length();
    }

    public static List<String> solve(String[] words) {
        List<String> result = new ArrayList<>();
        Set<String> seen = new HashSet<>();
        for (String word : words) {
            if (word.length()%2 != 0) result.add(word);
        }
        result.sort((a,b) -> {
            int order = Integer.compare(key(a),key(b));
            return order != 0 ? order : b.compareTo(a);
        });
        return result;
    }
}