[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$flEp1yLDfVjWjNHzK0sPMWubtNZlcA5EdHG31ZDA9Ix0":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2026-05-16 10:50:48",373056724,[8,9,10,11],"插入和删除操作更灵活","不需要连续存储空间","可以随机存取任意元素","存储空间可以动态扩充",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},85,"cc44a5360f64f1385f720020b2d0e8be","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F248490ee5259a06bb8e2c6db11872974.jpg","数据结构与算法A","work_53432880","大作业-2026-2026(2)","顺序表和链表相比,顺序表的优点是( )",[21,32,41,50,59,68,77,86,91,94],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],373056716,[25,26,27,28],"数据元素","字符","数据项","记录","线性表是一个具有 n 个( )的有限序列","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],373056717,[36,37,38,39],"线性表中的元素可以是任意类型","线性表中第一个元素没有前驱","线性表中最后一个元素没有后继","线性表中元素之间存在多对多的关系","关于线性表,下列描述不正确的是( )",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],373056718,[45,46,47,48],"0","n","n-1","n+1","在长度为 n 的线性表中,插入一个新元素并保持线性关系,最坏情况下需要移动( )个元素",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],373056719,[54,55,56,57],"s->next = p->next; p->next = s","p->next = s; s->next = p->next","s->next = p; p->next = s","p->next = s->next; s->next = p","在单链表中,要将 s 所指节点插入到 p 所指节点之后,正确的操作是( )",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":30,"type":31},[],373056720,[63,64,65,66],"head == NULL","head->next == NULL","head != NULL","head->next == head","对于一个带头节点的单链表,判断空表的条件是( )",{"answer":69,"createTime":5,"id":70,"options":71,"question":76,"source":30,"type":31},[],373056721,[72,73,74,75],"O(1)","O(n)","O(log n)","O(n²)","在单链表长度为 n 时,删除第 i 个节点(1 ≤ i ≤ n)的时间复杂度为( )",{"answer":78,"createTime":5,"id":79,"options":80,"question":85,"source":30,"type":31},[],373056722,[81,82,83,84],"遍历链表找到 p 的前驱","直接修改 p 和 s 的指针","交换 p 和 s 的数据域","删除 p 再插入","对于单链表,已知 p 指向某个节点,要在其前插入新节点 s,除了修改指针外,还需要( )",{"answer":87,"createTime":5,"id":88,"options":89,"question":90,"source":30,"type":31},[],373056723,[63,64,66,65],"一个循环链表(头指针为 head),长度为 n,其判定为空的条件是( )",{"answer":92,"createTime":5,"id":6,"options":93,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":95,"createTime":5,"id":96,"options":97,"question":102,"source":30,"type":31},[],373056725,[98,99,100,101],"顺序表","单链表","双向链表","单循环链表","若线性表最常用的操作是取第 i 个元素及其前驱,则采用( )存储方式最节省时间"]