[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f3eYu5H4MxLvZ89I7u3M03jDnX7gEXxJ3kLx9q_zTiXk":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":28,"type":29},[],"2024-01-02 14:04:06",125537471,[8,9,10,11],"ST-&gt;top!=0","ST-&gt;top==0","ST-&gt;top!=m0","ST-&gt;top==m0",{"courseId":13,"courseImg":14,"courseName":15},"c84cbfa7099c7ca05813323dcddfc96b","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F5cfe47c010ac1fd86052268f68d364fa.jpg","数据结构","判定一个栈ST(最多元素为m0)为空的条件是( )",[18,30,40,50,59,69,76,79,88,97],{"answer":19,"createTime":20,"id":21,"options":22,"question":27,"source":28,"type":29},[],"2024-01-02 14:04:02",125537439,[23,24,25,26],"fedcba","bcafed","dcefba","cabdef","若abcdef以所给的次序进栈,若在进栈操作时,允许出栈操作,则下面不可能的出栈序列是( )","v1",0,{"answer":31,"createTime":32,"id":33,"options":34,"question":39,"source":28,"type":29},[],"2024-01-02 14:04:03",125537445,[35,36,37,38],"栈满则出","后进先出","先进先出","栈空则进","栈中元素的进出原则( )",{"answer":41,"createTime":42,"id":43,"options":44,"question":49,"source":28,"type":29},[],"2024-01-02 14:04:04",125537449,[45,46,47,48],"它们的存储结构不一样","所包含的元素不一样","插入、删除操作的限定不一样","它们的逻辑结构不一样","栈和队列的主要区别在于( )",{"answer":51,"createTime":42,"id":52,"options":53,"question":58,"source":28,"type":29},[],125537452,[54,55,56,57],"rear=rear+1","rear=(rear+1)%(n-1)","rear=(rear+1)%n","rear=(rear+1)%(n+1)","循环队列存储在数组A[0&hellip;n],则入队时的操作为( )",{"answer":60,"createTime":61,"id":62,"options":63,"question":68,"source":28,"type":29},[],"2024-01-02 14:04:05",125537458,[64,65,66,67],"3和4","3和0","5和0","5和1","若用数组A[0&hellip;5]来实现循环队列,且当前rear和front的值分别为1和5,当从队列中删除一个元素,再加入两个元素后,rear和front的值分别为( )",{"answer":70,"createTime":61,"id":71,"options":72,"question":75,"source":28,"type":29},[],125537465,[37,36,73,74],"队空则进","队满则出","队列中元素的进出原则是( )",{"answer":77,"createTime":5,"id":6,"options":78,"question":16,"source":28,"type":29},[],[8,9,10,11],{"answer":80,"createTime":5,"id":81,"options":82,"question":87,"source":28,"type":29},[],125537480,[83,84,85,86],"5 1 2 3 4","4 5 1 3 2","4 3 1 2 5","3 2 1 5 4","设一个栈的输入序列是 1,2,3,4,5,则下列序列中,是栈的合法输出序列的是()",{"answer":89,"createTime":5,"id":90,"options":91,"question":96,"source":28,"type":29},[],125537483,[92,93,94,95],"空","满","上溢","下溢","在作进栈运算时,应先判别栈是否( )",{"answer":98,"createTime":99,"id":100,"options":101,"question":106,"source":28,"type":29},[],"2024-01-02 14:04:07",125537485,[102,103,104,105],"递归调用","函数调用","表达式求值","前三个选项都有","栈在 ( )中有所应用"]