Unverified50% confidenceFactExact time
连续（分数）背包问题可以用贪心算法求得最优解，因为它同时满足贪心选择性质与最优子结构
1
Sources
50%
Confidence
Long-term
Relevance
7/6/2026
First Seen
Sources
Greedy Algorithms and the Knapsack Problem: Core Notes from MIT 6.0002 Lecture 1
bilibiliAI从零开始学7/3/2026
Cite This Claim
Stable URI
https://kongchang.com/claim/114099API
curl https://kongchang.com/api/v1/knowledge/claims/114099MCP
get_claim(id=114099)