题目内容
Set the initial state of stack S and queue Q to be empty. Elements e1, e2, e3, e4, e5, and e6 push into the stack S in sequence. When an element is popped, it push into the queue Q immediately,if the pop sequence of 6 elements is e2, e4, e3, e6, e5, e1, then the capacity of stack S should be at least( ).
查看答案
搜索结果不匹配？点我反馈
更多问题
Design an algorithm to judge whether the brackets in the discriminant expression match the occurrence, and the data structure using ( ) is the best.
The suffix expression of the expression a * (b + c) -d is ( ).
When recursive procedures or function calls, a data structure of ( ) is needed to process parameters and return addresses.
If an array of size 6 is used to implement a circular queue, and the current values of rear and front are 0 and 3 respectively, when one element is deleted from the queue and two more elements are added, the value of rear and front is ( ).
微信支付 
支付宝支付