我用Java刷 leetcode 554. 砖墙

Posted 2021-06-02 深林无鹿

这里有leetcode题集分类整理！！！

哈希AC：

class Solution {
    public int leastBricks(List<List<Integer>> wall) {
        Map <Integer,Integer> hashMap = new HashMap <Integer, Integer>();
        for (List<Integer> widths : wall) {
            int n = widths.size() ;
            int sum = 0;
            for (int i = 0 ; i < n - 1 ; i ++) {
                sum += widths.get(i);
                hashMap.put(sum, hashMap.getOrDefault(sum, 0) + 1);
            } 
        }
        int maxRes = 0;
            for (Map.Entry<Integer , Integer> entry : hashMap.entrySet()) {
                maxRes = Math.max(maxRes, entry.getValue());
            }
        return wall.size() - maxRes;
    }
}