[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fAp3xeOqJpwnrjjTdSo0XYj0sfYqHAKUw6JbEIVbLvRQ":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":24,"type":25},[],"2025-10-28 19:11:45",225296387,[8,9,10,11],"串是一种特殊的线性表","串的长度必须大于零","串中的元素只能是字母","空串就是空白串",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},16,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","work_47328472","","下列关于串的叙述中正确的是( )",[21,26,35,44,53,62,71,80,89,98],{"answer":22,"createTime":5,"id":6,"options":23,"question":19,"source":24,"type":25},[],[8,9,10,11],"v1",0,{"answer":27,"createTime":5,"id":28,"options":29,"question":34,"source":24,"type":25},[],225296388,[30,31,32,33],"10","11","12","13","设有一个字符串 S="Hello World!",该串的长度为( )",{"answer":36,"createTime":5,"id":37,"options":38,"question":43,"source":24,"type":25},[],225296389,[39,40,41,42],"abcd","321AB",""abcABC"",""21AB"","以下( )不是"abcd321ABCD"串的子串",{"answer":45,"createTime":5,"id":46,"options":47,"question":52,"source":24,"type":25},[],225296390,[48,49,50,51],"串的各位置字符任意","串中各位置字符均对应相等","两个串含有相同的字符","两个串所含字符任意","两个串相等必有串长度相等并且( )",{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":24,"type":25},[],225296391,[57,58,59,60],"8","37","36","9","若串s="software",则其子串的个数是( )",{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":24,"type":25},[],225296392,[66,67,68,69],""123abcd"",""a123bcd"",""ab123cd"",""abc123d"","设 s="abcd",s1="123",则执行语句s2=InsStr(s,2,s1) 后(假设字符串的序号从0开始),s2=()",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":24,"type":25},[],225296393,[75,76,77,78],""abcd"",""abc"",""ad"",""ab"","设 s="abcd",则执行语句 s2=DelStr(s,2,2) 后,s2=()",{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":24,"type":25},[],225296394,[84,85,86,87],"O(1)","O(n)","O(n^2)","以上都不对","对于一个链串 s,查找第 i 个元素值为 x 的算法的时间复杂度为( )",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":24,"type":25},[],225296395,[93,94,95,96],"连接","模式匹配","求子串","求串长","设有两个串p 和 q,求 q在p 中首次出现的位置的运算称为( )",{"answer":99,"createTime":5,"id":100,"options":101,"question":106,"source":24,"type":25},[],225296396,[102,103,104,105],"二维数组和三维数组","三元组和散列","三元组和十字链表","散列和十字链表","稀疏矩阵一般的压缩存储方法有两种,即( )"]