update

lijiakof · Mar 7, 2021 · 2b397f7 · 2b397f7
1 parent e302217
commit 2b397f7
Show file tree

Hide file tree

Showing 7 changed files with 8 additions and 7 deletions.
diff --git a/README.md b/README.md
@@ -45,6 +45,7 @@
 * [Event Loop](share/js-eventloop.md)
 * [WEB 前端性能优化实战](share/web-front-performance.md)
 * [斐波那契数列](share/fibonacci.md)
+* [背包问题](share/knapsack.md)
 
 ## 技巧
 * [如何垂直居中](share/css-vetically.md)

diff --git a/babel.sketch b/babel.sketch
diff --git a/frontend-book.sketch b/frontend-book.sketch
diff --git a/ipfs.sketch b/ipfs.sketch
diff --git a/share/knapsack.md b/share/knapsack.md
@@ -0,0 +1,7 @@
+# 背包问题
+背包问题是一个非常经典的计算机算法问题，我们可以通过各种算法来实现它，但是如何快速准确的得到解，是我们需要研究的问题。话不多说先看问题：有 N 件物品和一个容器为 V 的背包。放入第 i 件物品耗费的费用是 Ci，得到的 价值是 Wi。求解将哪些物品装入背包可使价值总和最大。
+
+## 分析问题
+
+
+## 递归
diff --git a/share/lakka.md b/share/lakka.md
diff --git a/wallet.sketch b/wallet.sketch