Brick Wall

Similar Problems:

- Split Array into Consecutive Subsequences
- Find Duplicate Subtrees
- CheatSheet: Leetcode For Code Interview
- CheatSheet: Common Code Problems & Follow-ups
- Tag: #inspiring, #hashmap, #limitedrange

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.

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.

// https://code.dennyzhang.com/brick-wall // Basic Ideas: hashmap // map[int]int: track whether the edge ends for all bricks in all rows // Find the max value from the hashmap // The result is row_count - max_val // Complexity: Time O(n*m), Space O(1) // There would be no more than 20,000 keys in hashmap func leastBricks(wall [][]int) int { m := map[int]int{} max_cnt := 0 for _, row := range wall { length := 0 for j:=0; j<len(row)-1; j++{ length += row[j] m[length]++ if m[length] > max_cnt { max_cnt = m[length] } } } return len(wall) - max_cnt }