循环队列 SQ 采用数组空间 SQ.base[0, n-1] 存放其元素值,已知头指针 front 指向队列头元素,尾指针 rear 指向队列尾元素的下一个位置,则队列 SQ 为满的判断条件是()。
A.front == rear % n
B.front == (rear + 1 ) % n
C.front == rear % n - 1
D.front == rear % (n – 1 )
A.front == rear % n
B.front == (rear + 1 ) % n
C.front == rear % n - 1
D.front == rear % (n – 1 )
第1题
A.(rear-front+m)%m
B.rear-front+1
C.rear-front
D.front-rear
第2题
第3题
A.(rear—front+m)%m
B.rear-front+1
C.rear-front
D.rear-front-1
第4题
A.(rear-front+m)MODm
B.rear-fomt+1
C.rear-fribt-1
D.rear-front
第5题
A.(rear-front+m)MOD m
B.rear-front+1
C.rear-front+1
D.rear-front
第6题
A.(rear-front+m)mod m
B.(rear-front+1)mod m
C.(rear-front-1+m)mod m
D.(rear-front)mod m
第7题
A.(front-rear+1)%m
B.(rear-front+1)%m
C.(front-rear+m)%m
D.(rear-front+m)%m
第8题
(38) A.(front-rear+1)%m
B.(rear-front+1)% m
C.(front-rear+m)% m
D.(rear-front+m)% m
第9题
A.(rear-front+m)mod m
B.(rear-front+1)mod m
C.(rear-front-1+m)mod m
D.(rear-front)mod m
第10题
A.(rear-front+m) mod m
B.(rear-front+m+1) mod m
C.(rear-front+m-1) mod m
D.(rear-front-m-1) mod m
为了保护您的账号安全,请在“上学吧”公众号进行验证,点击“官网服务”-“账号验证”后输入验证码“”完成验证,验证成功后方可继续查看答案!