堆栈 - The Algorithms

The Algorithms

堆栈

数据结构

Balanced Parentheses

Dijkstras Two Stack Algorithm

Infix to Postfix Conversion

Infix to Prefix Conversion

Lexicographical Numbers

Next Greater Element

Postfix Evaluation

Prefix Evaluation

Stack Using Two Queues

Stack with Doubly Linked List

Stack with Singly Linked List

+3

Stock Span Problem

Evaluate Expression

Stack ES 6

Node Stack

Reverse Stack

Stack Array

Stack Array List

Dynamic Stack

Parenthesis

Array Stack

堆栈

Balanced Brackets

Celebrity Finder

Decimal To Any Using Stack

Duplicate Brackets

Greatest Element Constant Time

Infix To Postfix

Infix To Prefix

Largest Rectangle

Maximum Minimum Window

Min Stack Using Single Stack

Min Stack Using Two Stacks

Next Smaller Element

Palindrome With Stack

Postfix Evaluator

Postfix To Infix

Prefix Evaluator

Prefix To Infix

Smallest Element Constant Time

Sort Stack

Stack Postfix Notation

结构

Stack Linked List with List

© The Algorithms 2024

什么是算法?关于我们编程语言贡献捐赠

GitHub Gitter X 源码联系我们

Powered by Vercel