#leetcode编程日记#554. Brick Wall

题目描述

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 leastbricks.

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.

样例

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

注意事项

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.

解题思路

Bad思路

一开始是打算用一个矩阵保存每行每列砖块之间的空隙的。

声明这样一个矩阵：vector<vector<int>> through(matrix_row_size,vectr<int>(matrix_col_size-1,0));

0表示不能穿透，1表示此处是个空隙。

然后统计哪一列的‘1’更多，就意味着穿过的空隙越多，砖块越少。

实现的时候一般的样例还能过，但是遇到这种砖块矩阵就超出额定内存。

[[100000],

[100000],

[100000]]。

可用的思路

因为问题出在内存爆表就不用有大量冗余数据的矩阵，改用map保存有空隙的列的空隙数，如果某列没有空隙就不用在map中添加这一列。其余思路跟之前一样。

代码

class Solution {
public:
    int leastBricks(vector<vector<int>>& wall) {
        map<int,int> linethrough;
        int maxcnt=0;
        for(int i=0;i<wall.size();i++){
            int t=0;
            for(int j=0;j<wall[i].size()-1;j++){
                t+=wall[i][j];
                maxcnt=max(maxcnt,++linethrough[t-1]);
            }
        }
        return wall.size()-maxcnt;
    }
};