[leetcode]554. Brick Wall

题目链接：https://leetcode.com/problems/brick-wall/#/description

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: 

For each potential cut position - which is at the edge of any brick, I am counting the number of brick edges for all rows. Note that we need to use hash map to only track potential (not all) cuts. If bricks are very wide, you'll get MLE if you store all cut positions.

class Solution {
public:
    int leastBricks(vector<vector<int>>& wall) {
        if(wall.empty())
            return 0;
        int n = wall.size();
        unordered_map<int, int> edges;
        for(int i = 0; i < n; i++) {
            int acc = 0;
            for(int j = 0; j < wall[i].size() - 1; j++) {
                acc += wall[i][j];
                if(edges.find(acc) == edges.end()) {
                    edges[acc] = 1;
                } else {
                    edges[acc] += 1;
                }
            }
        }
        int res = n;
        for(auto iter = edges.begin(); iter != edges.end(); iter++) {
            res = min(res, n - iter->second);
        }
        return res;
    }
};

class Solution{
public:
    int leastBricks(vector<vector<int>>& wall)
    {
        unordered_map<int,int> edges;
        auto min_bricks=wall.size();
        for(auto row:wall)
        {
            for(auto i=0,width=0;i<row.size()-1;i++)
            {
                min_bricks=min(min_bricks,wall.size()-(++edges[width+=row[i]]));
            }
        }
        return min_bricks;
    }
};