leetcode栈
文章平均质量分 63
Bryan要加油
这个作者很懒,什么都没留下…
展开
-
853. Car Fleet[单调栈]
ProblemThere are n cars going to the same destination along a one-lane road. The destination is target miles away.You are given two integer array position and speed, both of length n, where position[i] is the position of the ith car and speed[i] is the s原创 2021-12-15 20:49:04 · 847 阅读 · 0 评论 -
1190. Reverse Substrings Between Each Pair of Parentheses[Medium](Leetcode每日一题-2021.05.26)--抄答案
ProblemYou 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.Constraints:0 <= s.lengt原创 2021-05-26 08:43:34 · 224 阅读 · 0 评论 -
1006. Clumsy Factorial(Leetcode每日一题-2021.04.01)
ProblemNormally, the factorial of a positive integer n is the product of all positive integers less than or equal to n. For example, factorial(10) = 10 * 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 * 1.We instead make a clumsy factorial: using the integers in decreas原创 2021-04-01 12:44:43 · 279 阅读 · 0 评论 -
456. 132 Pattern(Leetcode每日一题-2021.03.24)--抄答案
ProblemGiven an array of n integers nums, a 132 pattern is a subsequence of three integers nums[i], nums[j] and nums[k] such that i < j < k and nums[i] < nums[k] < nums[j].Return true if there is a 132 pattern in nums, otherwise, return false原创 2021-03-24 08:54:27 · 118 阅读 · 0 评论 -
150. Evaluate Reverse Polish Notation(Leetcode每日一题-2021.03.20)
ProblemEvaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, and /. Each operand may be an integer or another expression.Note that division between two integers should truncate toward zero.It is guarante原创 2021-03-20 08:09:11 · 197 阅读 · 0 评论 -
331. Verify Preorder Serialization of a Binary Tree(Leetcode每日一题-2021.03.12)
ProblemOne way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node’s value. If it is a null node, we record using a sentinel value such as #.For example, the above binary tree can be serialized原创 2021-03-12 19:33:23 · 139 阅读 · 0 评论 -
227. Basic Calculator II(Leetcode每日一题-2021.03.11)
ProblemGiven a string s which represents an expression, evaluate this expression and return its value.The integer division should truncate toward zero.Constraints:1 <= s.length <= 3 * 10^5s consists of integers and operators (’+’, ‘-’, ‘*’, ‘/’原创 2021-03-11 19:23:24 · 162 阅读 · 0 评论 -
224. Basic Calculator(Leetcode每日一题-2021.03.10)--抄答案
ProblemGiven a string s representing an expression, implement a basic calculator to evaluate it.Constraints:1 <= s.length <= 3 * 10^5s consists of digits, ‘+’, ‘-’, ‘(’, ‘)’, and ’ '.s represents a valid expression.Example1Input: s = “1 + 1原创 2021-03-10 19:01:37 · 170 阅读 · 0 评论 -
1047. Remove All Adjacent Duplicates In String(Leetcode每日一题-2021.03.09)
ProblemGiven a string S of lowercase letters, a duplicate removal consists of choosing two adjacent and equal letters, and removing them.We repeatedly make duplicate removals on S until we no longer can.Return the final string after all such duplicate r原创 2021-03-09 19:23:07 · 69 阅读 · 0 评论 -
503. Next Greater Element II(Leetcode每日一题-2021.03.06)
ProblemGiven a circular array (the next element of the last element is the first element of the array), print the Next Greater Number for every element. The Next Greater Number of a number x is the first greater number to its traversing-order next in the原创 2021-03-07 09:43:30 · 120 阅读 · 0 评论 -
85. Maximal Rectangle(Leetcode每日一题-2020.12.26)--抄答案
ProblemGiven a rows x cols binary matrix filled with 0’s and 1’s, find the largest rectangle containing only 1’s and return its area.Constraints:rows == matrix.lengthcols == matrix.length0 <= row, cols <= 200matrix[i][j] is ‘0’ or ‘1’Example原创 2020-12-26 21:42:42 · 169 阅读 · 0 评论 -
844. Backspace String Compare(Leetcode每日一题-2020.10.19)
ProblemGiven 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.Note:1 <= S.length <= 2001 <= T.len原创 2020-10-20 21:16:51 · 385 阅读 · 0 评论 -
20. Valid Parentheses(Leetcode每日一题-2020.08.14)
ProblemGiven 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 corr原创 2020-08-15 14:15:43 · 100 阅读 · 0 评论 -
32. Longest Valid Parentheses(Leetcode每日一题-2020.07.04)
ProblemGiven a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring.来源:力扣(LeetCode)Example1Input: “(()”Output: 2Explanation: The longest valid parentheses substring is “()”Exam原创 2020-07-04 09:45:27 · 240 阅读 · 0 评论 -
剑指 Offer 09. 用两个栈实现队列(Leetcode每日一题-2020.06.30)
Problem用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 appendTail 和 deleteHead ,分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素,deleteHead 操作返回 -1 )Example1输入:[“CQueue”,“appendTail”,“deleteHead”,“deleteHead”][[],[3],[],[]]输出:[null,null,3,-1]Example2输入:[“CQueue”,“deleteHead”原创 2020-06-30 14:01:41 · 272 阅读 · 0 评论 -
1028. Recover a Tree From Preorder Traversal(Leetcode每日一题-2020.06.18)
ProblemWe run a preorder depth first search on the root of a binary tree.At each node in this traversal, we output D dashes (where D is the depth of this node), then we output the value of this node. (If the depth of a node is D, the depth of its immedi原创 2020-06-18 22:40:32 · 246 阅读 · 0 评论 -
739. Daily Temperatures(Leetcode每日一题-2020.06.11)
ProblemGiven a list of daily temperatures T, return a list such that, for each day in the input, tells you how many days you would have to wait until a warmer temperature. If there is no future day for which this is possible, put 0 instead.For example, g原创 2020-06-13 08:08:57 · 238 阅读 · 0 评论 -
84. Largest Rectangle in Histogram(Leetcode每日一题-2020.05.30)
class Solution {public: int Max(int a, int b){return a > b ? a : b;} int largestRectangleArea(vector<int> &height) { height.push_back(0); stack<int> stk; int i = 0; int maxArea = 0; while(i &原创 2020-05-31 21:59:31 · 709 阅读 · 0 评论 -
394. Decode String(Leetcode每日一题-2020.05.28)
ProblemGiven an encoded string, return its decoded string.The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is guaranteed to be a positive integer.You may assume t原创 2020-05-28 23:26:37 · 186 阅读 · 0 评论 -
1290. Convert Binary Number in a Linked List to Integer
ProblemGiven head which is a reference node to a singly-linked list. The value of each node in the linked list is either 0 or 1. The linked list holds the binary representation of a number.Return th...原创 2020-05-05 19:59:32 · 199 阅读 · 0 评论 -
445. Add Two Numbers II(Leetcode每日一题-2020.04.14)
ProblemYou are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contain a single digit. Add the two numbers and ...原创 2020-04-14 22:46:25 · 194 阅读 · 0 评论 -
1111. Maximum Nesting Depth of Two Valid Parentheses Strings(Leetcode每日一题-2020.04.01)
ProblemA string is a valid parentheses string (denoted VPS) if and only if it consists of “(” and “)” characters only, and:It is the empty string, orIt can be written as AB (A concatenated with B)...原创 2020-04-01 20:29:04 · 292 阅读 · 0 评论 -
155. Min Stack&&面试题 03.02. Min Stack LCCI(Leetcode每日一题-2020.05.12)
ProblemHow 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 0(1) time.ExampleMinStack minS...原创 2020-03-26 22:43:30 · 238 阅读 · 0 评论 -
面试题 03.01. Three in One LCCI
ProblemDescribe how you could use a single array to implement three stacks.Yout should implement push(stackNum, value)、pop(stackNum)、isEmpty(stackNum)、peek(stackNum) methods. stackNum is the index o...原创 2020-03-26 22:30:26 · 256 阅读 · 0 评论 -
面试题 03.04. Implement Queue using Stacks LCCI
ProblemImplement a MyQueue class which implements a queue using two stacks.Notes:You must use only standard operations of a stack – which means only push to top, peek/pop from top, size, and is em...原创 2020-03-23 23:15:53 · 209 阅读 · 0 评论 -
225. Implement Stack using Queues(Leetcode每日一题-2020.03.01)
ProblemImplement 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...原创 2020-03-08 11:33:39 · 165 阅读 · 0 评论 -
94. Binary Tree Inorder Traversal
ProblemGiven a binary tree, return the inorder traversal of its nodes’ values.ExampleSolutionSolution1最最基本的递归解/** * Definition for a binary tree node. * struct TreeNode { * int val; * ...原创 2020-03-02 20:50:18 · 96 阅读 · 0 评论