Brick Wall
来源:互联网 发布:java在线学习网站源码 编辑:程序博客网 时间:2024/05/16 08:41
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 leastbricks.
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.
class Solution { public int leastBricks(List<List<Integer>> wall) { if(wall == null || wall.size() == 0) return 0; //则反过来想,越多越好 HashMap<Integer, Integer> map = new HashMap<>(); for(int i=0;i<wall.size();i++) { List<Integer> row = wall.get(i); int index = 0; for(int j=0;j<row.size()-1;j++) { index += row.get(j); put(map, index); } } int max = 0; for(Map.Entry<Integer, Integer> entry: map.entrySet()) { int value = entry.getValue(); //System.out.println(value); max = Math.max(max, value); } return max == 0? wall.size(): wall.size() - max; } private void put(HashMap<Integer, Integer> map, int value) { if(map.containsKey(value)) { map.put(value, map.get(value) + 1); } else map.put(value, 1); }}
- Brick Wall
- Brick Wall
- Brick Wall
- UVa900 - Brick Wall Patterns
- Brick Wall Patterns
- 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
- [LeetCode] Brick Wall
- 554. Brick Wall
- [LeetCode] 554. Brick Wall
- PAT 1065. A+B and C (64bit) (20) 大整数,有正负,加减。疑问已解决
- 一道关于jvm加载的简单题目
- 再论方正何处去?
- Ubuntu Qt5.6.2 ld -lGL Error solution
- 机械与编程我的人生路漫漫
- Brick Wall
- YP.1.6 Computers as Universal Computational Devices(双语)
- 关闭SSH不结束某希望进程结束,屏蔽SIGHUP信号--nohup
- Can Place Flowers
- YP.1.7 How Do We Get the Electrons to Do The Work?(双语)
- YP.1 Exercises
- 应优先大力发展智能环境安全可信度评价算法
- 花了一个通宵总算解决了sitemesh对于struts2转发地址不进行装饰的问题
- JS刷新当前页面的几种方法总结