[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fzPuJiZj31lB6Ds1vQoGmMpMvcQAehYmo_wY4GOnmmnc":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":27,"type":28},[],"2026-03-27 22:05:53",329987981,[8,9,10,11],"01背包用动态规划求解,部分背包用贪心算法求解","01背包用贪心算法求解,部分背包用动态规划求解","背包问题都用贪心算法求解","背包问题都用动态规划求解",{"courseId":13,"courseImg":14,"courseName":15},"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","关于背包问题,正确的是()",[18,29,38,47,56,65,74,83,90,99],{"answer":19,"createTime":5,"id":20,"options":21,"question":26,"source":27,"type":28},[],329987928,[22,23,24,25],"总能求得最优解,保证两艘船都装满","效率低于贪心算法,通常不用","可以求出解,但不一定能把两艘船装满","无法求解,也不能保证两艘船都装满","两艘船的装载问题用回溯法求解()","v1",0,{"answer":30,"createTime":5,"id":31,"options":32,"question":37,"source":27,"type":28},[],329987930,[33,34,35,36],"贪心选择","集装箱排序","初始化数据结构","输出装载方案","采用贪心算法求解最优装载问题的主要计算量在于()",{"answer":39,"createTime":5,"id":40,"options":41,"question":46,"source":27,"type":28},[],329987932,[42,43,44,45],"广度优先分支限界法与深度优先分支限界法","队列式(FIFO)分支限界法与堆栈式分支限界法","排列树法与子集树法","队列式(FIFO)分支限界法与优先队列式分支限界法","常见的两种分支限界法为()",{"answer":48,"createTime":5,"id":49,"options":50,"question":55,"source":27,"type":28},[],329987934,[51,52,53,54],"最优子结构","贪心选择性质","构造最优解","构造最优解D.定义最优解","贪心算法与动态规划算法的主要区别是",{"answer":57,"createTime":5,"id":58,"options":59,"question":64,"source":27,"type":28},[],329987936,[60,61,62,63],"选择当前价值最大的箱子","选择当前重量最重的箱子","选择当前价值最小的箱子","选择当前重量最轻的箱子","最优装载问题的贪心策略是",{"answer":66,"createTime":5,"id":67,"options":68,"question":73,"source":27,"type":28},[],329987938,[69,70,71,72],"子集树","排列树","深度优先生成树","广度优先生成树","分支限界法解旅行商问题时的解空间树是()",{"answer":75,"createTime":5,"id":76,"options":77,"question":82,"source":27,"type":28},[],329987940,[78,79,80,81],"对每一个子问题只需求解一次并保存解,当再次遇到此子问题时,只需调用此解","对每一个子问题必须求解一次不保存解,当再次遇到此子问题时,还需再次求解","对每一个子问题只求解这次需使用的解,当再次遇到此子问题时,还需再次求解","对每一个子问题不需求解一次更不保存,当再次遇到此子问题时,再来进行求解","在动态规划算法中,关于重叠子问题的处理方法是",{"answer":84,"createTime":5,"id":85,"options":86,"question":89,"source":27,"type":28},[],329987942,[70,69,87,88],"n叉树","随问题而动态变化的树","批处理作业调度问题的解空间树为",{"answer":91,"createTime":5,"id":92,"options":93,"question":98,"source":27,"type":28},[],329987944,[94,95,96,97],"线性表以顺序方式存储,并且按关键码值排好序","线性表以链式方式存储,并且按关键码值排好序","线性表以顺序方式存储,并且按关键码的检索频率排好序","线性表以链式方式存储,并且按关键码的检索频率排好序","线性表进行二分查找法查找,其前提条件是()",{"answer":100,"createTime":5,"id":101,"options":102,"question":107,"source":27,"type":28},[],329987946,[103,104,105,106],"整数规划的最优值等于其线性规划的最优值","整数规划的最优值小于等于其线性规划的最优值","没法比较","整数规划的最优值大于等于其线性规划的最优值","求解最大值问题时,整数规划的最优值与其对应的线性规划的最优值之间的关系是"]