求画一条线穿过的最少砖数 Brick Wall

为什么80%的码农都做不了架构师？>>>   

问题：

There is a brick wall in front of you. The wall is rectangular and has several rows of bricks. The bricks have the same height but different width. You want to draw a vertical line from the top to the bottom and cross the least bricks.

The brick wall is represented by a list of rows. Each row is a list of integers representing the width of each brick in this row from left to right.

If your line go through the edge of a brick, then the brick is not considered as crossed. You need to find out how to draw the line to cross the least bricks and return the number of crossed bricks.

You cannot draw a line just along one of the two vertical edges of the wall, in which case the line will obviously cross no bricks.

Example:

Input: 
[[1,2,2,1],
 [3,1,2],
 [1,3,2],
 [2,4],
 [3,1,2],
 [1,3,1,1]]
Output: 2
Explanation: 

Note:

1. The width sum of bricks in different rows are the same and won't exceed INT_MAX.
2. The number of bricks in each row is in range [1,10,000]. The height of wall is in range [1,10,000]. Total number of bricks of the wall won't exceed 20,000.

解决：

【题意】

给定一个二维数组wall表示一面墙，wall中的每一行表示一排砖头的长度。从墙的顶端向底部画一条线，求这条线穿过的最少砖块个数。

这条线不能是墙的左右边界。

注意：

1. 每一行砖块的宽度之和都相同，并且不超过INT_MAX
2. 每一行砖块的个数以及高度在[1, 10,000]之间。砖块总数不超过20,000

① 按行累加砖块的长度，统计每块砖的右边界，对边界出现的次数进行计数。不需要统计左右边界。

墙壁的的行数 - 出现次数最多的边界个数即为答案。注意判断每行都只有一块砖的情况。使用map记录边界出现的次数。

class Solution {//40ms
    public int leastBricks(List<List<Integer>> wall) {
        Map<Integer,Integer> map = new HashMap<>();
        for (List<Integer> row : wall){
            int sum = 0;
            for (int i = 0;i < row.size() - 1;i ++){
                sum += row.get(i);
                map.put(sum,map.getOrDefault(sum,0) + 1);
            }
        }
        int res = wall.size();
        for (int key : map.keySet()){
            res = Math.min(res,wall.size() - map.get(key));
        }
        return res;
    }
}

② 一些细节

class Solution {//36ms
    public int leastBricks(List<List<Integer>> wall) {
        Map<Integer,Integer> map = new HashMap<>();
        int sum = 0;
        int max = 0;
        int count = 0;
        for (List<Integer> row : wall){
            sum = 0;
            for (int i = 0;i < row.size() - 1;i ++){
                sum += row.get(i);
                if (map.containsKey(sum)){
                    count = map.get(sum) + 1;
                }else {
                    count = 1;
                }
                map.put(sum,count);
                max = Math.max(max,count);
            }
        }
        return wall.size() - max;
    }
}

转载于:https://my.oschina.net/liyurong/blog/1605051