isLouisHsu / isLouisHsu/isLouisHsu.github.io
【数据结构】栈与队列 | LOUIS' BLOG
Open
Nobody has claimed this yet.
4673c47814fc75311f2f3f3f77a84986
Gitalk
- Dominant language
- HTML
- Stars
- 4
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
栈定义及抽象数据描述定义：栈(stack)是一种特殊的线性表，其插入(aka. 入栈、压栈)和删除(aka. 出栈、弹栈)操作在表的同一端进行，即后进先出(last-in-first-out, LIFO)。两端称作栈顶(top)、栈底(bottom)。 抽象数据描述：1234567891011抽象数据类型 stack{ 实例: linearList; 操作：
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by opening the linked LOUIS' BLOG article and reviewing the repository's existing blog content structure. The issue does not identify a target file, requested change, or completion criteria, so clarify whether the Chinese stack-and-queue article should be added, corrected, or otherwise updated before proceeding.
Written by the indexing model from the issue text.
Assessment
- Domain
- content, documentation
- Issue type
- Documentation
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100