CodeSprout 官方2026/10/04 00:19

官方解答 · 置頂Java

官方解答｜展場標籤排序

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

import java.util.*;

public class Solution {
    private static int key(String word) {
        return word.isEmpty() ? -1 : Character.toLowerCase(word.charAt(0));
    }

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