问:
原题链接:砖墙
答:
class Solution {
public int leastBricks(List<List<Integer>> wall) {
Map<Integer,Integer> map = new HashMap<Integer,Integer>();//定义哈希表
for(List<Integer> list:wall)
{
int n = list.size();
int sum = 0;
for(int i = 0;i < n - 1;i++)
{
sum += list.get(i);
map.put(sum,map.getOrDefault(sum,0) + 1);
}
}
int max = 0;
for(Map.Entry<Integer,Integer> entry:map.entrySet())
{
max = Math.max(max,entry.getValue());
}
return wall.size() - max;
}
}