[LeetCode] 554. Brick Wall
来源:互联网 发布:廖雪峰python教程mobi 编辑:程序博客网 时间:2024/05/29 19:15
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.
class Solution {public: int leastBricks(vector<vector<int>>& wall) { unordered_map<int, int> hash; int MaxApper = 0; for (int i = 0; i < wall.size(); i++) { int RightEdge = 0; for (int j = 0; j < wall[i].size() - 1; j++) { RightEdge += wall[i][j]; if (!hash.count(RightEdge)) { hash[RightEdge] = 1; } else { hash[RightEdge]++; } MaxApper = max(MaxApper, hash[RightEdge]); } } return wall.size() - MaxApper; }};
- Leetcode-554. Brick Wall
- [leetcode] 554. Brick Wall
- [LeetCode]554. Brick Wall
- [LeetCode]554. Brick Wall
- [leetcode]554. Brick Wall
- [LeetCode] 554. Brick Wall
- leetcode 554. Brick Wall
- #leetcode编程日记#554. Brick Wall
- [Leetcode] 554. Brick Wall 解题报告
- [LeetCode] Brick Wall
- LeetCode.554 Brick Wall
- 554. Brick Wall
- 554. Brick Wall
- 554. Brick Wall
- 554. Brick Wall
- 554. Brick Wall
- 554. Brick Wall
- 554. Brick Wall。
- centos6.9安装mysql5.7
- 16、Android 生成.so文件
- RobotStudio仿真—工作站逻辑
- poj union_find相关之1611 The Suspects
- java调用scp,文件从本地复制到远程
- [LeetCode] 554. Brick Wall
- maven资源库
- 适配器模式
- Mac下Nginx启动、重启和关闭
- Swarm、Fleet、Kubernetes、Mesos
- 过滤器Filter
- 直接插入排序
- Muduo网络库源码分析(二) 定时器TimeQueue,Timer,TimerId
- 数据结构学习—“一般树”的基本概念和知识