如何遍历HashMap<String、Set<String>>并返回最大的Set<String>？

import java.util.HashMap;
import java.util.Map;
import java.util.Set;

public class HashMapTraversal {
    public static Set<String> findLargestSet(HashMap<String, Set<String>> hashMap) {
        int maxSize = 0;
        Set<String> maxSet = null;

        for (Map.Entry<String, Set<String>> entry : hashMap.entrySet()) {
            Set<String> set = entry.getValue();
            if (set.size() > maxSize) {
                maxSize = set.size();
                maxSet = set;
            }
        }

        return maxSet;
    }

    public static void main(String[] args) {
        HashMap<String, Set<String>> hashMap = new HashMap<>();
        // 添加键值对到hashMap

        Set<String> largestSet = findLargestSet(hashMap);
        System.out.println("最大的Set<String>为：" + largestSet);
    }
}