问题描述:
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.
示例:
Input: [[1,2,2,1], [3,1,2], [1,3,2], [2,4], [3,1,2], [1,3,1,1]] Output: 2 Explanation:
问题分析:
本题考察各行相同长度和的数目,只要是长度和相同,且行数量最多,那么这就是需要画线的地方,可用hashmap求解。
过程详见代码:
class Solution {
public:
int leastBricks(vector<vector<int>>& wall) {
unordered_map<int, int> m;
int sum,maxSum = 0, n = wall.size();
for (int i = 0; i < n; i++)
{
sum = 0;
for (int j = 0; j < wall[i].size() - 1; j++)
{
sum += wall[i][j];
m[sum]++;
if (m[sum] > maxSum) maxSum = m[sum];
}
}
return n - maxSum;
}
};