栈
文章平均质量分 94
memcpy0
希望探索文理结合的自由之路。
展开
-
LeetCode 20. 有效的括号【栈,字符串】简单
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.An input string is valid if:Open brackets must be closed by the same type of brackets.Open brackets must be closed in the correct orde原创 2020-08-15 00:31:48 · 278 阅读 · 1 评论 -
LeetCode 341. 扁平化嵌套列表迭代器【设计,迭代器,DFS或栈】中等
本文属于「征服LeetCode」系列文章之一,这一系列正式开始于2021/08/12。由于LeetCode上部分题目有锁,本系列将至少持续到刷完所有无锁题之日为止;由于LeetCode还在不断地创建新题,本系列的终止日期可能是永远。在这一系列刷题文章中,我不仅会讲解多种解题思路及其优化,还会用多种编程语言实现题解,涉及到通用解法时更将归纳总结出相应的算法模板。。原创 2023-10-20 16:29:55 · 198 阅读 · 1 评论 -
LeetCode 449. Serialize and Deserialize BST【树,BFS,DFS,栈】困难
本文属于「征服LeetCode」系列文章之一,这一系列正式开始于2021/08/12。由于LeetCode上部分题目有锁,本系列将至少持续到刷完所有无锁题之日为止;由于LeetCode还在不断地创建新题,本系列的终止日期可能是永远。在这一系列刷题文章中,我不仅会讲解多种解题思路及其优化,还会用多种编程语言实现题解,涉及到通用解法时更将归纳总结出相应的算法模板。。原创 2023-09-09 17:09:12 · 236 阅读 · 0 评论 -
LeetCode 1003. Check If Word Is Valid After Substitutions【栈,字符串】中等
就能返回。原创 2023-05-03 19:09:46 · 732 阅读 · 1 评论 -
LeetCode C++ 1190. Reverse Substrings Between Each Pair of Parentheses【Deque/Stack/String】中等
You are given a string s that consists of lower case English letters and brackets.Reverse the strings in each pair of matching parentheses, starting from the innermost one.Your result should not contain any brackets.Example 1:Input: s = "(abcd)"Output原创 2020-12-25 17:27:18 · 184 阅读 · 0 评论 -
LeetCode C++ 227. Basic Calculator II【Stack/String】中等
Given a string s which represents an expression, evaluate this expression and return its value. The integer division should truncate toward zero.Example 1:Input: s = "3+2*2"Output: 7Example 2:Input: s = " 3/2 "Output: 1Example 3:Input: s =原创 2020-12-25 17:03:53 · 185 阅读 · 1 评论 -
LeetCode C++ 1081. Smallest Subsequence of Distinct Characters【Greedy/Stack/String】中等
Return the lexicographically smallest subsequence of s that contains all the distinct characters of s exactly once.Example 1:Input: s = "bcabc"Output: "abc"Example 2:Input: s = "cbacdcbc"Output: "acdb"Constraints:1 <= s.length <= 1000s co原创 2020-12-24 23:02:26 · 194 阅读 · 0 评论 -
LeetCode C++ 316. Remove Duplicate Letters【Stack/Greedy/String】中等
Given a string s, remove duplicate letters so that every letter appears once and only once. You must make sure your result is the smallest in lexicographical order among all possible results.Example 1:Input: s = "bcabc"Output: "abc"Example 2:Input: s原创 2020-12-24 22:50:16 · 296 阅读 · 0 评论 -
LeetCode C++ 150. Evaluate Reverse Polish Notation【Stack/String】中等
Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Note:Division between two integers should truncate toward zero.The given RPN expression is a原创 2020-12-16 00:24:52 · 182 阅读 · 0 评论 -
LeetCode C++ 946. Validate Stack Sequences【Stack】中等
Given two sequences pushed and popped with distinct values, return true if and only if this could have been the result of a sequence of push and pop operations on an initially empty stack.Example 1:Input: pushed = [1,2,3,4,5], popped = [4,5,3,原创 2020-12-11 00:57:05 · 259 阅读 · 0 评论 -
LeetCode C++ 剑指 Offer 31. 栈的压入、弹出序列【Stack】中等
Given two sequences pushed and popped with distinct values, return true if and only if this could have been the result of a sequence of push and pop operations on an initially empty stack.Example 1:Input: pushed = [1,2,3,4,5], popped = [4,5,3,原创 2020-12-11 00:51:35 · 207 阅读 · 0 评论 -
LeetCode C++ 25. Reverse Nodes in k-Group【Linked List/Stack】困难
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k then left-out nodes, in the原创 2020-12-04 16:15:04 · 279 阅读 · 0 评论 -
LeetCode C++ 面试题 08.06. Hanota LCCI【Stack/Recursion】简单
In the classic problem of the Towers of Hanoi, you have 3 towers and N disks of different sizes which can slide onto any tower. The puzzle starts with disks sorted in ascending order of size from top to bottom (i.e., each disk sits on top of an even larger原创 2020-11-17 15:18:39 · 253 阅读 · 0 评论 -
LeetCode C++ 面试题 03.04. Implement Queue using Stacks LCCI【Stack/Queue/Design】简单
Implement a MyQueue class which implements a queue using two stacks.Example:MyQueue queue = new MyQueue();queue.push(1);queue.push(2);queue.peek(); // return 1queue.pop(); // return 1queue.empty(); // return falseNotes:You must use only stan原创 2020-11-13 01:03:27 · 159 阅读 · 0 评论 -
LeetCode C++ 682. Baseball Game【模拟/栈】简单
You are keeping score for a baseball game with strange rules. The game consists of several rounds, where the scores of past rounds may affect future rounds’ scores.At the beginning of the game, you start with an empty record. You are given a list of strin原创 2020-11-05 02:00:02 · 588 阅读 · 0 评论 -
LeetCode 445. Add Two Numbers II【链表,栈】中等
本文属于「征服LeetCode」系列文章之一,这一系列正式开始于2021/08/12。由于LeetCode上部分题目有锁,本系列将至少持续到刷完所有无锁题之日为止;由于LeetCode还在不断地创建新题,本系列的终止日期可能是永远。在这一系列刷题文章中,我不仅会讲解多种解题思路及其优化,还会用多种编程语言实现题解,涉及到通用解法时更将归纳总结出相应的算法模板。。原创 2020-11-04 20:09:09 · 167 阅读 · 0 评论 -
LeetCode C++ 1021. Remove Outermost Parentheses【Stack】简单
A valid parentheses string is either empty (""), "(" + A + ")", or A + B, where A and B are valid parentheses strings, and + represents string concatenation. For example, "", "()", "(())()", and "(()(()))" are all valid parentheses strings.A valid parent原创 2020-10-24 09:56:26 · 199 阅读 · 0 评论 -
LeetCode 844. 比较含退格的字符串【字符串,快慢指针或栈】简单
Given two strings S and T, return if they are equal when both are typed into empty text editors. # means a backspace character.Note that after backspacing an empty text, the text will continue empty.Example 1:Input: S = "ab#c", T = "ad#c"Output: trueE原创 2020-10-20 17:36:38 · 299 阅读 · 1 评论 -
LeetCode C++ 面试题 03.02. Min Stack LCCI【Stack/Design】简单
How would you design a stack which, in addition to push and pop, has a function min which returns the minimum element? Push, pop and min should all operate in O(1) time.Example:MinStack minStack = new MinStack();minStack.push(-2);minStack.push(0);minS原创 2020-10-19 22:42:56 · 182 阅读 · 0 评论 -
POJ 程序设计与算法(二)第03周测验(2020春季) 001:Boolean Expressions【中缀转后缀并求值】
总时间限制: 1000ms内存限制: 65536kB描述The objective of the program you are going to produce is to evaluate boolean expressions as the one shown next:Expression: ( V | V ) & F & ( F | V )where V is ...原创 2020-03-13 22:15:07 · 383 阅读 · 0 评论 -
【数据结构Java实现】栈 【数组栈、链栈】
文章目录一、栈与应用二、栈的基本操作和实现介绍三、动态数组实现顺序栈ArrayStack四、栈的应用一:括号匹配一、栈与应用栈也是一种线性数据结构,相比数组,涉及的操作更少,相当与栈的子集。只能从一段添加元素,另一端取出元素,LIFOLIFOLIFO。通过这样的限制,栈在计算机世界里,拥有了不可思议的作用。下面的就是一个栈:| | <--栈顶| || || ...原创 2020-03-10 22:33:58 · 221 阅读 · 0 评论 -
Leetcode C++ 20. Valid Parentheses 【Stack】
Given a string containing just the characters ‘(’, ‘)’, ‘{’, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.An input string is valid if:Open brackets must be closed by the same type of bra...原创 2020-01-06 20:42:00 · 309 阅读 · 0 评论 -
LeetCode C++ 232. Implement Queue using Stacks【Queue】【使用栈实现队列】
Implement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes the element from in front of queue.peek() -- Get the front element.empty(...原创 2020-02-23 14:19:39 · 189 阅读 · 0 评论 -
LeetCode C++ 225. Implement Stack using Queues 【Stack】【使用队列实现栈】
Implement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get the top element.empty() -- Return whet...原创 2020-02-23 14:19:02 · 264 阅读 · 0 评论