[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fQcJpdKZBxSlewMe9DGGEwmw6_1Y2H34AmDv0A_FX6Sc":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":24,"type":25},[],"2025-01-21 20:51:44",177398673,[8,9,10,11],"串是字符的有限序列","子串是串中任意连续字符组成的子序列","串可以采用顺序存储或链式存储","空串是由一个或多个空格组成的串",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},18,"ea8a4f4fe5f49977d0033e1c4e55a588","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F78b360bc4aaeaa6c2aeb0e20ec23672e.png","数据结构（data  structure）","work_40220256","第十五章 第五节 库欣综合征病人的护理","1. 以下有关串的描述中,( )是不正确的",[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},[],177398674,[30,31,32,33],"串中包含的字符个数","串中包含的不同字符个数","串中除空格以外的字符个数","串中包含的不同字母个数","串的长度是指( )",{"answer":36,"createTime":5,"id":37,"options":38,"question":43,"source":24,"type":25},[],177398675,[39,40,41,42],"数据元素是子串","数据元素均为字符","数据元素数据类型不受限制","表长受到限制","串也是一种线性表,只不过( )",{"answer":45,"createTime":5,"id":46,"options":47,"question":52,"source":24,"type":25},[],177398676,[48,49,50,51],"定长顺序","堆","链式","散列","若串中字符经常发生变化,则采用( )",{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":24,"type":25},[],177398677,[57,58,59,60],"1","0","-1","64","已知两个串S = "abcczym"和T = "abccyzm",则StrCmp操作的结果是( )",{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":24,"type":25},[],177398678,[66,67,68,69],"求子串","串连接","串插入","模式匹配","设有两个串S和T,求T在S中首次出现的位置的运算是( )运算",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":24,"type":25},[],177398679,[75,76,77,78],"tk","tnext[k]","tnext[j]","tj","在KMP算法中,若模式串T中存在tj = tk(k = next[j]),且si ≠ tj时,则下一次不必与tk进行比较,而直接和( )进行比较",{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":24,"type":25},[],177398680,[84,85,86,87],"-1 0 0 0 0 1 2 1","-1 0 0 1 0 1 2 1","-1 0 1 0 0 2 1 2","-1 0 1 2 0 0 0 1","模式串"abccabab"的next值为( )",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":24,"type":25},[],177398681,[93,94,95,96],"-1 0 1 1 0 0 -1 1 4","-1 0 -1 1 -1 0 -1 1 4","-1 0 0 0 -1 0 0 1 4","-1 0 0 1 2 0 0 1 4","模式串"cbcacbcab"的nextval值为( )",{"answer":99,"createTime":5,"id":100,"options":101,"question":106,"source":24,"type":25},[],177398682,[102,103,104,105],"O(n + m)","O(n - m)","O(n × m)","O(n ÷ m)","Brute-Force算法在最坏情况下的时间复杂度( )"]