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