Skip to content

fix: #42 fix typo #286

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 5 commits into from
Jan 27, 2020
Merged

fix: #42 fix typo #286

Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
f4d1b61
fix:修复547题代码变量返回错误的bug
fireairforce Nov 12, 2019
93f597e
fix:修复547变量名错误
fireairforce Nov 12, 2019
0fd39f9
Merge remote-tracking branch 'upstream/master'
fireairforce Jan 23, 2020
a5cd3c2
fix: #42 fix typo
fireairforce Jan 23, 2020
3701817
Update 42.trapping-rain-water.md
fireairforce Jan 25, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions problems/42.trapping-rain-water.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -38,11 +38,11 @@ for(let i = 0; i < height.length; i++) {
}

```
如上图那么h为 [1, 1, 2, 2, ,2 ,2, ,3, 2, 2, 2, 1]

问题转化为求h，那么h[i]又等于`左右两侧柱子的最大值中的较小值`，即
`h[i] = Math.min(左边柱子最大值, 右边柱子最大值)`

如上图那么h为 [0, 1, 1, 2, 2, 2 ,2, 3, 2, 2, 2, 1]

问题的关键在于求解`左边柱子最大值`和`右边柱子最大值`,
我们其实可以用两个数组来表示`leftMax`, `rightMax`，
以leftMax为例，leftMax[i]代表i的左侧柱子的最大值，因此我们维护两个数组即可。
Expand Down