554. Brick Wall
来源:互联网 发布:如何把矩阵正交化 编辑:程序博客网 时间:2024/06/05 04:02
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: 2Explanation:
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.
public class Solution { public int leastBricks(List<List<Integer>> wall) { if(wall == null || wall.size() == 0){ return 0; } int count = 0; HashMap<Integer, Integer> map = new HashMap<Integer, Integer>(); for(int i=0; i<wall.size();i++){ int split = 0; for(int j=0; j<wall.get(i).size()-1;j++){ split += wall.get(i).get(j); if(!map.containsKey(split)){ map.put(split, 1); }else{ map.put(split, map.get(split) + 1); } } } for(int i : map.values()){ if(i>count){ count = i; } } return wall.size() - count; }}
- Leetcode-554. Brick Wall
- [leetcode] 554. Brick Wall
- 554. Brick Wall
- 554. Brick Wall
- [LeetCode]554. Brick Wall
- 554. Brick Wall
- [LeetCode]554. Brick Wall
- 554. Brick Wall
- [leetcode]554. Brick Wall
- 554. Brick Wall
- 554. Brick Wall
- [LeetCode] 554. Brick Wall
- leetcode 554. Brick Wall
- 554. Brick Wall。
- 554. Brick Wall
- 554. Brick Wall (map)
- Brick Wall
- Brick Wall
- 【面试题22】二叉搜索树的后序遍历
- activity之间的切换效果
- Base64随记
- QT Creator4.3制作图标
- SYD8801 UART使用说明【uart轮发数据代码实现】【 uart中断发数据代码实现】【RFSleep函数对串口的影响】【中断中调用串口打印函数有可能会造成死机】
- 554. Brick Wall
- Thrift使用示例
- Vuforia和CardBoard冲突问题
- CSS javascript web前端的研究
- 树莓派基础教程--无显示器系统安装
- 2.1 synchronized同步方法
- 零星知识
- 王浩算法—DMU
- 使用docker部署gitlab