public class WordCounter {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.println("請輸入一段文本:");
        String text = scanner.nextLine();
        // 使用HashMap統(tǒng)計單詞出現(xiàn)次數(shù)
        HashMap<String, Integer> wordCount = new HashMap<>();
        // 分割文本為單詞（按空格和標點符號分割）
        String[] words = text.split("[\\s\\p{Punct}]+");
        for (String word : words) {
            if (!word.isEmpty()) {
                String lowerWord = word.toLowerCase(); // 不區(qū)分大小寫
                wordCount.put(lowerWord, wordCount.getOrDefault(lowerWord, 0) + 1);
            }
        }
        // 輸出統(tǒng)計結(jié)果
        System.out.println("\n單詞統(tǒng)計結(jié)果:");
        for (Map.Entry<String, Integer> entry : wordCount.entrySet()) {
            System.out.println(entry.getKey() + ": " + entry.getValue());
        }
    }
}

String[] words = text.split("[\\s\\p{Punct}]+");

wordCount.put(lowerWord, wordCount.getOrDefault(lowerWord, 0) + 1);

// 傳統(tǒng)方式
if (wordCount.containsKey(lowerWord)) {
    wordCount.put(lowerWord, wordCount.get(lowerWord) + 1);
} else {
    wordCount.put(lowerWord, 1);
}
// 現(xiàn)代方式（推薦）
wordCount.put(lowerWord, wordCount.getOrDefault(lowerWord, 0) + 1);

HashMap<String, Integer> wordCount = new HashMap<>(expectedSize);

Arrays.stream(words)
      .parallel()
      .forEach(word -> {
          // 統(tǒng)計邏輯
      });

public class DeduplicationAndSorting {
    public static void main(String[] args) {
        // 創(chuàng)建包含重復元素的整數(shù)列表
        ArrayList<Integer> numbers = new ArrayList<>(Arrays.asList(
            5, 2, 8, 2, 1, 9, 5, 3, 7, 1, 4, 6, 8, 3
        ));
        System.out.println("原始列表: " + numbers);
        // 使用HashSet去重
        HashSet<Integer> uniqueNumbers = new HashSet<>(numbers);
        System.out.println("去重后: " + uniqueNumbers);
        // 使用TreeSet排序（自動排序）
        TreeSet<Integer> sortedNumbers = new TreeSet<>(uniqueNumbers);
        System.out.println("排序后: " + sortedNumbers);
        // 或者使用Collections.sort()方法
        ArrayList<Integer> sortedList = new ArrayList<>(uniqueNumbers);
        Collections.sort(sortedList);
        System.out.println("使用Collections.sort()排序: " + sortedList);
    }
}

class Student {
    private String id;
    private String name;
    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Student student = (Student) o;
        return Objects.equals(id, student.id);
    }
    @Override
    public int hashCode() {
        return Objects.hash(id);
    }
}

// 降序排序
TreeSet<Integer> descendingSet = new TreeSet<>(Collections.reverseOrder());
descendingSet.addAll(uniqueNumbers);
// 自定義對象排序
TreeSet<Student> studentSet = new TreeSet<>(
    Comparator.comparing(Student::getName)
              .thenComparing(Student::getAge)
);