2.05 ✅ Stack

Stack #

  • 括号匹配问题及类似问题。第 20 题,第 921 题,第 1021 题。
  • 栈的基本 pop 和 push 操作。第 71 题,第 150 题,第 155 题,第 224 题,第 225 题,第 232 题,第 946 题,第 1047 题。
  • 利用栈进行编码问题。第 394 题,第 682 题,第 856 题,第 880 题。
  • 单调栈利用栈维护一个单调递增或者递减的下标数组。第 84 题,第 456 题,第 496 题,第 503 题,第 739 题,第 901 题,第 907 题,第 1019 题。
No.TitleSolutionDifficultyTimeComplexitySpaceComplexityFavoriteAcceptance
0020Valid ParenthesesGoEasyO(log n)O(1)40.2%
0032Longest Valid ParenthesesGoHard30.2%
0042Trapping Rain WaterGoHardO(n)O(1)❤️52.5%
0071Simplify PathGoMediumO(n)O(n)❤️35.5%
0084Largest Rectangle in HistogramGoHardO(n)O(n)❤️38.1%
0094Binary Tree Inorder TraversalGoEasyO(n)O(1)67.4%
0114Flatten Binary Tree to Linked ListGoMedium54.2%
0143Reorder ListGoMedium42.3%
0144Binary Tree Preorder TraversalGoEasyO(n)O(1)58.8%
0145Binary Tree Postorder TraversalGoEasyO(n)O(1)59.4%
0150Evaluate Reverse Polish NotationGoMediumO(n)O(1)39.8%
0155Min StackGoEasyO(n)O(n)47.5%
0173Binary Search Tree IteratorGoMediumO(n)O(1)61.7%
0224Basic CalculatorGoHardO(n)O(n)38.7%
0225Implement Stack using QueuesGoEasyO(n)O(n)48.9%
0227Basic Calculator IIGoMedium39.2%
0232Implement Queue using StacksGoEasyO(n)O(n)53.7%
0234Palindrome Linked ListGoEasy43.3%
0331Verify Preorder Serialization of a Binary TreeGoMediumO(n)O(1)41.4%
0341Flatten Nested List IteratorGoMedium56.6%
0385Mini ParserGoMedium34.9%
0394Decode StringGoMediumO(n)O(n)53.7%
0402Remove K DigitsGoMediumO(n)O(1)28.8%
0445Add Two Numbers IIGoMedium57.1%
0456132 PatternGoMediumO(n)O(n)30.7%
0496Next Greater Element IGoEasyO(n)O(n)66.7%
0503Next Greater Element IIGoMediumO(n)O(n)59.5%
0581Shortest Unsorted Continuous SubarrayGoMedium33.2%
0589N-ary Tree Preorder TraversalGoEasy74.7%
0636Exclusive Time of FunctionsGoMediumO(n)O(n)56.2%
0682Baseball GameGoEasyO(n)O(n)68.1%
0726Number of AtomsGoHardO(n)O(n)❤️51.2%
0735Asteroid CollisionGoMediumO(n)O(n)43.5%
0739Daily TemperaturesGoMediumO(n)O(n)65.4%
0844Backspace String CompareGoEasyO(n)O(n)47.2%
0856Score of ParenthesesGoMediumO(n)O(n)65.1%
0880Decoded String at IndexGoMediumO(n)O(n)28.2%
0895Maximum Frequency StackGoHardO(n)O(n)63.7%
0897Increasing Order Search TreeGoEasy75.1%
0901Online Stock SpanGoMediumO(n)O(n)61.9%
0907Sum of Subarray MinimumsGoMediumO(n)O(n)❤️32.8%
0921Minimum Add to Make Parentheses ValidGoMediumO(n)O(n)75.5%
0946Validate Stack SequencesGoMediumO(n)O(n)64.5%
1003Check If Word Is Valid After SubstitutionsGoMediumO(n)O(1)57.1%
1006Clumsy FactorialGoMedium54.1%
1019Next Greater Node In Linked ListGoMediumO(n)O(1)58.4%
1021Remove Outermost ParenthesesGoEasyO(n)O(1)79.4%
1047Remove All Adjacent Duplicates In StringGoEasyO(n)O(1)71.6%
1111Maximum Nesting Depth of Two Valid Parentheses StringsGoMedium72.7%
1190Reverse Substrings Between Each Pair of ParenthesesGoMedium64.8%
1209Remove All Adjacent Duplicates in String IIGoMedium56.9%
1249Minimum Remove to Make Valid ParenthesesGoMedium64.5%
1614Maximum Nesting Depth of the ParenthesesGoEasy82.6%
1653Minimum Deletions to Make String BalancedGoMedium52.5%
1673Find the Most Competitive SubsequenceGoMedium45.9%
1700Number of Students Unable to Eat LunchGoEasy67.7%
——————————————————————-——-—————-—————————-————-————-

⬅️上一页

下一页➡️

Calendar Jul 16, 2021
Edit Edit this page
本站总访问量:  次 您是本站第  位访问者