[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fQxmYOHe4TaZ3IgLGZcAPIG0Jenq_R1z-c9zFPA18CK8":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":27,"type":28},[],"2023-05-19 08:24:15",17650682,[8,9,10,11],"O (sort(N))","O(scan(N))","O(scan(N))IO","IO(scan(N))",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},3,"83a018af0da8935baa37296d08474812","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2767552b8829d9c9937f13c5d4c0ce11.jpg","大数据算法","40b23f2e503e44bd8bab91f065a809c1","6.1","对给定顶点邻接链表T,其一个欧拉回路可以以()IO复杂性求得",[21,29,34],{"answer":22,"createTime":5,"id":23,"options":24,"question":26,"source":27,"type":28},[],17650680,[25,8,11,9],"IO (sort(N))","为数T的每个结点标上子树大小的I\u002FO复杂度为()","v1",0,{"answer":30,"createTime":5,"id":31,"options":32,"question":33,"source":27,"type":28},[],17650681,[25,8,11,9],"前序计数的I\u002FO复杂度为()",{"answer":35,"createTime":5,"id":6,"options":36,"question":19,"source":27,"type":28},[],[8,9,10,11]]