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