[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fd146QuE0byFzGtz7GElbhDs_wh7lJRhtH4Jb3Yxvg74":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":21,"type":22},[],"2026-05-23 10:51:22",383406868,[8,9,10,11],"s.top == -1","s.top == 0","s.top == 1","s.top == MAXSIZE",{"courseId":13,"courseImg":14,"courseName":15},"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","基于该 SeqStack 结构体定义(top 指向栈顶元素的下一个位置),判断栈为空的条件是( )",[18,23,32,41,50,59,68,77,86,94],{"answer":19,"createTime":5,"id":6,"options":20,"question":16,"source":21,"type":22},[],[8,9,10,11],"v1",0,{"answer":24,"createTime":5,"id":25,"options":26,"question":31,"source":21,"type":22},[],383406869,[27,28,29,30],"s.a[s.top++] = x","s.a[++s.top] = x","s.a[s.top--] = x","s.a[--s.top] = x","若要将元素 x 压入栈 s 中,且假设栈未满,正确的核心操作代码是( )",{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":21,"type":22},[],383406870,[36,37,38,39],"x = s.a[s.top++]","x = s.a[++s.top]","x = s.a[s.top--]","x = s.a[--s.top]","若要从栈 s 中弹出一个元素并赋值给变量 x,且假设栈非空,正确的核心操作代码是( )",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":21,"type":22},[],383406871,[45,46,47,48],"6","7","8","9","设栈 s 的 MAXSIZE 为 10,当前 s.top 的值为 5.若连续执行 3 次入栈操作,再执行 1 次出栈操作,此时 s.top 的值为( )",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":21,"type":22},[],383406872,[54,55,56,57],"将栈顶运算符弹出并输出,当前运算符继续与新的栈顶比较","将当前运算符直接压入栈中","报错,因为运算符顺序错误","将当前运算符丢弃","在利用栈进行算术表达式求值(如中缀转后缀)时,若当前扫描到的运算符优先级 高于 栈顶运算符,应采取的操作是( )",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":21,"type":22},[],383406873,[63,64,65,66],"sq.front == 0","sq.rear == 0","sq.front == sq.rear","sq.front != sq.rear","关于该结构体定义的队列,下列关于"队空"判断条件的描述,正确的是",{"answer":69,"createTime":5,"id":70,"options":71,"question":76,"source":21,"type":22},[],383406874,[72,73,74,75],"sq.rear = sq.rear + 1","sq.rear = (sq.rear + 1) % MAXSIZE","sq.rear = (sq.rear - 1) % MAXSIZE","sq.rear = sq.rear % (MAXSIZE - 1)","若使用上述结构体实现"循环队列",且数组最大下标为 MAXSIZE-1,则入队操作(插入元素)时,更新 rear 指针的正确语句是",{"answer":78,"createTime":5,"id":79,"options":80,"question":85,"source":21,"type":22},[],383406875,[81,82,83,84],"(sq.rear + 1) % MAXSIZE == sq.front","sq.rear == sq.front + 1","sq.rear == MAXSIZE - 1","(sq.rear) % MAXSIZE == sq.front","在循环队列中,为了区分队列"已满"和"队空"的状态(已知队空为 front == rear),通常采用"牺牲一个存储单元"的方法.此时,判断队列已满的条件是",{"answer":87,"createTime":5,"id":88,"options":89,"question":93,"source":21,"type":22},[],383406876,[90,45,91,92],"4","-6","10","假设 MAXSIZE 为 10,当前 front = 8,rear = 2(循环队列状态),则当前队列中实际包含的元素个数是",{"answer":95,"createTime":5,"id":96,"options":97,"question":102,"source":21,"type":22},[],383406877,[98,99,100,101],"下溢","真上溢","假上溢","栈溢出","若使用数组实现非循环的顺序队列(即 rear 和 front 只增不减),当 rear == MAXSIZE 但队列中实际元素很少时,这种现象被称为"]