THE NOTEBOOK

Keep exploring.

Ideas accumulate. The threads continue here.

02 / THE NOTEBOOK21

Latest notes.

Algorithms & data structures2023.12.03

首先我们需要知道什么是0-1背包问题。即N件物品和最多能承受重量W的背包，第i件物品的重量为Weight[i]，价值为Value[i]。每件物品只能使用一次，求解将那些物品放入背包能使价值最大。这就是标准的0-1背包问题。 ## 1.暴力解法暴力

03 / ABOUT ME

This is doovvv’s personal notebook: questions from studying, discoveries from practice, and a little room for ideas still taking shape.

Computer ScienceAlgorithmsAI & Systems