CS_learn/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2026-02-02 18:39:09 +08:00
Code Issues Packages Projects Releases Wiki Activity

修改错别字“下表”->“下标”

Browse Source 
Signed-off-by: bqlin <bqlins@163.com>
This commit is contained in:
bqlin
2021-12-10 13:45:56 +08:00
parent 94e5dea6f0
commit e12257efc7
23 changed files with 52 additions and 52 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
problems/0084.柱状图中最大的矩形.md
View File

@@ -140,9 +140,9 @@ public:
heights.push_back(0); // 数组尾部加入元素0
st.push(0);
int result = 0;
// 第一个元素已经入栈，从下表1开始
// 第一个元素已经入栈，从下标1开始
for (int i = 1; i < heights.size(); i++) {
// 注意heights[i] 是和heights[st.top()] 比较 ，st.top()是下表
// 注意heights[i] 是和heights[st.top()] 比较 ，st.top()是下标
if (heights[i] > heights[st.top()]) {
st.push(i);
} else if (heights[i] == heights[st.top()]) {
@@ -251,9 +251,9 @@ class Solution {
st.push(0);
int result = 0;
// 第一个元素已经入栈，从下表1开始
// 第一个元素已经入栈，从下标1开始
for (int i = 1; i < heights.length; i++) {
// 注意heights[i] 是和heights[st.top()] 比较 ，st.top()是下表
// 注意heights[i] 是和heights[st.top()] 比较 ，st.top()是下标
if (heights[i] > heights[st.peek()]) {
st.push(i);
} else if (heights[i] == heights[st.peek()]) {