classSolution{publicintleastBricks(List<List<Integer>> wall){int n = wall.size();//行数Map<Integer,Integer> times =newHashMap<>();//间隙位置出现的次数,同一位置的间隙,每行只可能有一个for(int i =0, sum =0; i < n; i++){for(int num : wall.get(i)){
sum += num;
times.put(sum, times.getOrDefault(sum,0)+1);}
times.remove(sum);//最后一个边缘不能算
sum =0;}int max =0;for(int key : times.keySet()){
max =Math.max(max, times.get(key));}return n - max;}}