[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fNzbIJOkEQk21BFf3Qc6ADR1JRlMLsOH-5-ZW6oJi7rg":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":24,"type":69},[],"2026-04-07 23:11:17",335847757,[8,9,10,11],"录","隶","腻","冽",{"courseId":13,"courseImg":14,"courseName":15},"dce27acb6efe2e7209d27ef64edae31b","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F95c2e987a51e76a7ce715862f1d69248.jpg","普通话与口才训练","下列哪个字的声母是鼻音",[18,26,31,36,41,46,51,56,61,70],{"answer":19,"createTime":20,"id":21,"options":22,"question":23,"source":24,"type":25},[],"2026-01-09 01:11:39",307296568,[],"阐述动态规划的最优子结构性质,并以0-1背包问题为例说明","v1",4,{"answer":27,"createTime":20,"id":28,"options":29,"question":30,"source":24,"type":25},[],307296569,[],"分析贪心算法在大数据特征选择中的应用及局限性",{"answer":32,"createTime":20,"id":33,"options":34,"question":35,"source":24,"type":25},[],307296570,[],"比较Prim和Kruskal算法在实现和适用场景上的异同",{"answer":37,"createTime":20,"id":38,"options":39,"question":40,"source":24,"type":25},[],307296571,[],"比较回溯法与分支限界法的异同点",{"answer":42,"createTime":20,"id":43,"options":44,"question":45,"source":24,"type":25},[],307296572,[],"比较分治、动态规划、贪心、回溯、分支限界法的适用问题特征及复杂度特点",{"answer":47,"createTime":20,"id":48,"options":49,"question":50,"source":24,"type":25},[],307296573,[],"比较FIFO、LIFO和优先队列式分支限界法的特点及适用场景",{"answer":52,"createTime":20,"id":53,"options":54,"question":55,"source":24,"type":25},[],307296574,[],"设计一个动态规划算法,解决大数据场景下的用户购买商品的路径推荐问题",{"answer":57,"createTime":20,"id":58,"options":59,"question":60,"source":24,"type":25},[],307296575,[],"分析回溯法在大数据场景下的局限性及改进策略",{"answer":62,"createTime":5,"id":63,"options":64,"question":16,"source":24,"type":69},[],335847756,[65,66,67,68],"农","林","里","劳",0,{"answer":71,"createTime":5,"id":6,"options":72,"question":16,"source":24,"type":69},[],[8,9,10,11]]