Problem
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:
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.
Solution: HashTable
Count boundaries, cut at the location with most common boundaries.
Time complexity: O(|bricks|)
Space complexity: O(|bricks|)
C++
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
// Author: Huahua // Running time: 42 ms class Solution { public: int leastBricks(vector<vector<int>>& wall) { unordered_map<int, int> count; int max_count = 0; for (const auto& bricks : wall) { int s = 0; for (int i = 0; i < bricks.size() - 1; ++i) { s += bricks[i]; max_count = max(max_count, ++count[s]); } } return wall.size() - max_count; } }; |
请尊重作者的劳动成果，转载请注明出处！花花保留对文章／视频的所有权利。
如果您喜欢这篇文章／视频，欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
huahualeetcode
Be First to Comment