LeetCode#554 Brick Wall (week14)

week14

题目

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.

Note:
The width sum of bricks in different rows are the same and won’t exceed INT_MAX.
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.

原题地址：https://leetcode.com/problems/brick-wall/description/

解析

题目将每行的砖块的长度以数组形式给出，要求找到以某个位置纵向切下经过的砖最少的砖的数量。
大致思路为记录以k位置纵向切下时经过的砖的边沿的数量。先找出每行砖的边沿所在的位置，将该位置的数量加1。本题的重点是如果以数组来记录k位置经过的砖的边沿的数量，如果一块砖的长度很大但是每行的边沿很少，数组所占的空间太大，用map取代数组能有效节省空间，当沿该位置切下有经过边沿时才为该位置增加一个条目，否则边沿为0，经过的砖的数量不可能是最小的。

代码

class Solution {
public:
    int leastBricks(vector<vector<int>>& wall) {
        /* mp[k]为以k位置恰好为砖的边沿的数量 */
        map<int, int> mp;
        int height = wall.size();
        int width = 0;
        /* 找到墙的宽度 */
        for (int i = 0; i < wall[0].size(); ++i) {
            width += wall[0][i];
        }
        /* 遍历每行砖的边沿所在的位置 */
        for (int i = 0; i < height; ++i) {
            int slot = 0;
            for (int j = 0; j < wall[i].size(); ++j) {
                slot += wall[i][j];
                if (slot < width) {
                    ++mp[slot];
                }
            }
        }
        /* 将最小值初始化为height，即每行都经过砖 */
        int minCrossNum = height;
        for (int i = 0; i < mp.size(); ++i) {
            if (height - mp[i] < minCrossNum) {
                /* height - mp[i]为i位置经过的砖的数量 */
                minCrossNum = height - mp[i];
            }
        }

        return minCrossNum;
    }
};