1.总高度恒定,求穿过砖的最小值,等价于总高度减去穿过缝隙的最大值,由反得正
2.
https://blog.csdn.net/q5706503/article/details/85122343
Java中Map的 entrySet() 详解以及用法(四种遍历map的方式)
map.entrySet()将map中表示键值对的entry项转为set
entry项用Map.Entry<-,->表示
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); //每遍历一个sum则对应value值加一
}
}
int maxCnt = 0;
for (Map.Entry<Integer, Integer> entry : cnt.entrySet()) { // entrySet
maxCnt = Math.max(maxCnt, entry.getValue());
}
return wall.size() - maxCnt;
}
}