[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fKae2CX20_dtwZMd1U26WCiOOvIVHrhtleG9Vl9mFn40":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":15,"related":16,"source":20,"type":21},[],"2025-04-07 08:51:09",1062940656,[8,9,10,11],"top[2]-top[1]|=0","top[1]+1=top[2]","top[1]+top[2]=m","top[1]=top[2]",{"courseImg":13,"courseName":14},"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F95e7c4827ad0878b99b62fa98eaa907e.jpg","算法大视界","若栈采用顺序存储方式存储,现两栈共享空间V[1..m],top[i]代表第i个栈( i =1,2)栈顶,栈1的底在v[1],栈2的底在V[m],则栈满的条件是( )",[17,22,32,41,50,59,68,77,86,95],{"answer":18,"createTime":5,"id":6,"options":19,"question":15,"source":20,"type":21},[],[8,9,10,11],"v2",0,{"answer":23,"createTime":24,"id":25,"options":26,"question":31,"source":20,"type":21},[],"2025-04-07 08:51:08",1062940675,[27,28,29,30],"方法递归就是指在一个方法的内部调用自身的过程","方法递归其实就是调用其他方法","方法递归是指方法的返回值不同","其他说法都不对","关于方法的递归,以下说法正确的是( )",{"answer":33,"createTime":24,"id":34,"options":35,"question":40,"source":20,"type":21},[],1062940700,[36,37,38,39],"23","37","44","46","由带权为9,2,5,7的四个叶子结点构造一棵哈夫曼树,该树的带权路径长度为( )",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":20,"type":21},[],1062940796,[45,46,47,48],"p=p->next","p->next=p->next->next","p->next=p","p->next=null","在单链表中删除结点p(p不是最后一个结点)的后继的语句是( )",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":20,"type":21},[],1062940820,[54,55,56,57],"循环队列","链表","哈希表","栈","以下与数据的存储结构无关的术语是( )",{"answer":60,"createTime":24,"id":61,"options":62,"question":67,"source":20,"type":21},[],1062940832,[63,64,65,66],"单链表","单循环链表","带尾指针的单循环链表","带头结点的双循环链表","设一个链表最常用的操作是在末尾插入结点和删除尾结点,则选用( )最节省时间",{"answer":69,"createTime":5,"id":70,"options":71,"question":76,"source":20,"type":21},[],1062940854,[72,73,74,75],"指向链表的第一个结点的指针,称为头指针","单链表的每一个结点都被一个指针所指",".终端结点的指针域就为NULL","尾指针变量具标识单链表的作用,故常用尾指针变量来命名单链表","对于单链表表示法,以下说法错误的是( )",{"answer":78,"createTime":24,"id":79,"options":80,"question":85,"source":20,"type":21},[],1062940866,[81,82,83,84],"1","2","3","4","在快速排序,归并排序,插入排序,选择排序,冒泡排序中,使用到分治思想的算法个数有几个( )",{"answer":87,"createTime":5,"id":88,"options":89,"question":94,"source":20,"type":21},[],1062940901,[90,91,92,93],"插入排序","归并排序","堆排序","快速排序","对于排序算法,经常关注的是其时间复杂度和稳定性.下列排序算法中平均时间复杂度是O(n\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F0421a20a310fa93601b8c83bd3aca8c7.png\">)且稳定的是?( )",{"answer":96,"createTime":5,"id":97,"options":98,"question":103,"source":20,"type":21},[],1062940928,[99,100,101,102],"有穷性","可行性","确定性","正确性","一个算法是能行的,即算法中描述的操作都是可以通过已经实现的基本运算执行有限次来实现的,是指算法的( )特性"]