isLouisHsu / isLouisHsu/isLouisHsu.github.io

【算法】单调栈和单调队列 | LOUIS' BLOG

Open
#79 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

b492226f72ee69bd172ad2b948bce812 Gitalk
Dominant language
HTML
Stars
4
Forks
1
PR merge metrics
No merged PRs in 30d

Description

https://louishsu.xyz/2020/06/29/%E3%80%90%E7%AE%97%E6%B3%95%E3%80%91%E5%8D%95%E8%B0%83%E6%A0%88%E5%92%8C%E5%8D%95%E8%B0%83%E9%98%9F%E5%88%97/

目录 目录 单调栈:解决下一个更大元素问题 原理 下一个更大元素 I 下一个更大元素 II 每日温度 柱状图中最大的矩形 单调队列:解决滑动窗口问题 原理 滑动窗口最大值 单调栈:解决下一个更大元素问题原理单调栈(monotonic stack)是在栈的基础上添加一些逻辑,使每次新元素入栈后,栈内的元素都保持有序(单调递增或单调递减),用于解决下一个更大元素问题(next greate

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start with the linked LOUIS' BLOG article and the issue body, which contains its outline about monotonic stacks and queues. Inspect the repository's existing blog content to determine what change is intended; completion cannot be defined until the target files and desired update are specified.

Written by the indexing model from the issue text.

Assessment

Domain
documentation
Issue type
Documentation
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
15/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.