Leetcode Hot100 Hash

Leetcode Hot100 Hash

题号： 1、49、128

import java.util.*;

//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public List<List<String>> groupAnagrams(String[] strs) {
        List<List<String>> res = new ArrayList<>();
        Map<String,List<String>> rec = new HashMap<>();

        for (String str : strs) {
            char[] chars = str.toCharArray();
            Arrays.sort(chars);
            String key = new String(chars);
            List<String> value = rec.getOrDefault(key,new ArrayList<>());
            value.add(str);
            rec.put(key,value);
        }
        for (List<String> value : rec.values()) {
            res.add(value);
        }
        return res;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

class Solution {
    public int longestConsecutive(int[] nums) {
        Set<Integer> num_set = new HashSet<Integer>();
        for (int num : nums) {
            num_set.add(num);
        }

        int longestStreak = 0;

        for (int num : num_set) {
            if (!num_set.contains(num - 1)) {
                int currentNum = num;
                int currentStreak = 1;

                while (num_set.contains(currentNum + 1)) {
                    currentNum += 1;
                    currentStreak += 1;
                }

                longestStreak = Math.max(longestStreak, currentStreak);
            }
        }

        return longestStreak;
    }
}

收获

• MAP.getOrDefault方法
  
• HashSet：底层仍为HashMap，value为 PRESENT（占位符）