[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fYB0US0g6dU8MDXtR7-wzWwmS0ojfJZOna_jzfba-kpE":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2025-10-22 21:29:22",223556152,[8,9,10,11],"01234","01122","01211","01111",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},51,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","work_46566377","2025年秋季学期数据结构与算法","在字符串的KMP模式匹配算法中,需先求解模式串的next函数值,其定义如下式所示,j表示模式串中字符的序号(从1开始).若模式串p为"abaac",则其next函数值为(). \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fb70e1d70d237aaebdc1a720694a59c3e.png\">",[21,32,41,44,53,62,71,80,89,98],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],223556150,[25,26,27,28],"在有向图中,出度为0的结点称为叶子结点","用邻接矩阵表示图,容易判断任意两个结点之间是否有边连接,并求得各结点的度","按深度方向遍历图和先序遍历树类似,得到的结果是唯一的","若有向图G中从结点vi到结点vj有一条路径,则在图G的结点的线性序列中结点vi比在结点vj之前的话,则称为一个拓扑序列","下列有关图的说法错误的是().(京东2019春)","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],223556151,[36,37,38,39],"qu->rear – qu->front ==MaxSize","qu->rear – qu->front -1==MaxSize","qu->rear ==qu->front","qu->rear =qu->front -1","判定一个循环队列qu(最多元素为MaxSize)为空的条件是( )",{"answer":42,"createTime":5,"id":6,"options":43,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":45,"createTime":5,"id":46,"options":47,"question":52,"source":30,"type":31},[],223556153,[48,49,50,51],"树","字符串","队列","栈","以下数据结构中,( )是非线性结构",{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":30,"type":31},[],223556154,[57,58,59,60],"24","36","52","30","按{12,24,36,90,52,30}的顺序构成的平衡二叉树,其根结点是()",{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":30,"type":31},[],223556155,[66,67,68,69],"顺序存储,元素随机排列","双向链表存储,元素随机排列","顺序存储,元素有序排列","双向链表存储,元素有序排列","在线性表L中进行二分查找,要求L( ).(软考2020下半年)",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":30,"type":31},[],223556156,[75,76,77,78],"2 3 1 4","1 4 2 3","4 2 3 1","3 1 2 4","栈是先进后出的数据结构.给定一个大小为3的初始状态为空的栈,已知一组数据经过这个栈后,最终的数据顺序依次为:1 3 2 4 ,问原始的进栈数据不可能是以下的那组( ).(来自牛客网)",{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":30,"type":31},[],223556157,[84,85,86,87],"45","31","53","65","若A=10,B=4,C=6,D=4,E=15,则后缀表达式"AB*CD+-E+"的值为 ( ).(来自牛客网)",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":30,"type":31},[],223556158,[93,94,95,96],"a1<a2<…<am-1<am<b1<b2<…<bn-1<bn","b1<b2<…<bn-1<bn<a1<a2<…<am-1<am","a1<b1<a2<b2<…<am-1<bm-1<am<bm<bm+1<…<","b1<b2<…<bm-1<bm<a1<a2<…<am-1<am<bm+1<…","两个递增序列A和B的长度分别为m和n(m<n 且m与n接近),将二者归并为一个长度为m+n的递增序列.当元素关系为( ),归并过程中元素的比较次数最少",{"answer":99,"createTime":5,"id":100,"options":101,"question":106,"source":30,"type":31},[],223556159,[102,103,104,105],"冒泡排序","插入排序","归并排序","选择排序","以下哪种排序算法平均时间复杂度最低( ).(小米2019秋招算法笔试题(A))"]