Java | Leetcode Java题解之第554题砖墙

题目：

题解：

class Solution {public int leastBricks(List<List<Integer>> wall) {Map<Integer, Integer> cnt = 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);cnt.put(sum, cnt.getOrDefault(sum, 0) + 1);}}int maxCnt = 0;for (Map.Entry<Integer, Integer> entry : cnt.entrySet()) {maxCnt = Math.max(maxCnt, entry.getValue());}return wall.size() - maxCnt;}
}