OJ
Ctrlk
  • Introduction
  • Some Tips
  • strStr and Coding Style
  • Binary Search
  • Binary Tree & Divide Conquer
  • Dynamic Programming I
  • Dynamic Programming II
  • Linked List
  • Array & Numbers
  • Heap
  • Hash
  • Multiple Pointers
  • Stack
    • Implement Queue by Two Stacks
    • 155. Min Stack
    • Implement Stack using Queues
    • 结合前面的输入
      • 20. Valid Parentheses
      • Evaluate Reverse Polish Notation
      • Baseball Game
      • 71. Simplify Path
      • Longest Absolute File Path
    • 维持递增或递减
    • Nested
    • Tree Traversal
  • Breadth-first Search
  • Bit Manipulation
  • Math
  • Trie
  • Graph
  • Union Find
  • Exhaustive Search
  • String
  • Greedy
  • Design
  • Queue
Powered by GitBook
On this page

Was this helpful?

  1. Stack

结合前面的输入

20. Valid ParenthesesEvaluate Reverse Polish NotationBaseball Game71. Simplify PathLongest Absolute File Path
PreviousImplement Stack using QueuesNext20. Valid Parentheses

Last updated 6 years ago

Was this helpful?