[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fP2V4Yk_Dcfdg71dkfcLPkWHRFKb77IxiTEXtAll4UYA":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":28,"type":29},[],"2023-12-23 19:15:52",120242490,[8,9,10,11],"afedcb","cbdaef","dcebfa","bcaefd",{"courseId":13,"courseImg":14,"courseName":15},"0bf298b63a2b8e83a64ee618933fb30c","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F25b30343053994e8940089572d36015b.jpg","数据结构与算法","若元素a、b、c、d、e、f依次进栈,允许进栈、退栈的操作交替进行,但不允许连续3次退栈工作,则不可能得到的出栈序列是( )",[18,30,39,48,57,66,75,84,87,96],{"answer":19,"createTime":20,"id":21,"options":22,"question":27,"source":28,"type":29},[],"2023-12-23 19:15:51",120242480,[23,24,25,26],"读指定位置的元素","以上都不是","插入元素","删除元素","以下属于数组的基本运算的是( )","v1",0,{"answer":31,"createTime":20,"id":32,"options":33,"question":38,"source":28,"type":29},[],120242481,[34,35,36,37],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fe19970bf45755b3791fc6af68fbcc1a3.png\">","n","n-1","(n-1)2","对于一个具有n个顶点的无向图,若采用邻接矩阵存储,则该矩阵的大小是( )",{"answer":40,"createTime":20,"id":41,"options":42,"question":47,"source":28,"type":29},[],120242482,[43,44,45,46],"空串是只含有空格字符的串","串是含有零个或多个字符的有穷序列","空串是含有零个字符或含有空格字符的串","串是含有一个或多个字符的有穷序列","关于串的叙述,正确的是( )",{"answer":49,"createTime":20,"id":50,"options":51,"question":56,"source":28,"type":29},[],120242484,[52,53,54,55],"O(1)","O(n)","O(n2)","以上都不对","对于一个链串s,查找第一个元素值为x的算法的时间复杂度为( )",{"answer":58,"createTime":20,"id":59,"options":60,"question":65,"source":28,"type":29},[],120242486,[61,62,63,64],"二叉树就是度为2的树","二叉树中不存在度大于2的结点","二叉树中每个结点的度都为2","二叉树就是度为2有序树","以下关于二叉树的说法中正确的是( )",{"answer":67,"createTime":20,"id":68,"options":69,"question":74,"source":28,"type":29},[],120242487,[70,71,72,73],"40","28","29","6","设二维数组a[1..5][1..8],若按行优先的顺序存放数组的元素,则a[4][6]元素的前面有( )个元素",{"answer":76,"createTime":5,"id":77,"options":78,"question":83,"source":28,"type":29},[],120242489,[79,80,81,82],"9","37","36","8","若串str="Software",其子串的数目是( )",{"answer":85,"createTime":5,"id":6,"options":86,"question":16,"source":28,"type":29},[],[8,9,10,11],{"answer":88,"createTime":5,"id":89,"options":90,"question":95,"source":28,"type":29},[],120242492,[91,92,93,94],"后进后出","后进先出","不分顺序","先进先出","对于栈操作数据的原则是( )",{"answer":97,"createTime":5,"id":98,"options":99,"question":104,"source":28,"type":29},[],120242493,[100,101,102,103],"1","2","4","3","给定一个足够大的空栈,有4个元素的进栈次序为A、B、C、D,则以C、D开头的出栈序列的个数为( )"]