41 缺失的第一个正数 class Solution { public int firstMissingPositive(int[] nums) { Map<Integer, Integer> map = new HashMap<>(); for (int i : nums) { map.put(i, -1); } int res = 1; while (map.containsKey(res)) { res++; } return res; } }42 接雨水 class Solution { public int trap(int[] height) { int r...