diff --git a/README.md b/README.md
index a7835cb..b9be781 100644
--- 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
new file mode 100644
index 0000000..8217bab
Binary files /dev/null and b/babel.sketch differ
diff --git a/frontend-book.sketch b/frontend-book.sketch
index 644cd03..0037d93 100644
Binary files a/frontend-book.sketch and b/frontend-book.sketch differ
diff --git a/ipfs.sketch b/ipfs.sketch
new file mode 100644
index 0000000..d80f35e
Binary files /dev/null and b/ipfs.sketch differ
diff --git a/share/knapsack.md b/share/knapsack.md
new file mode 100644
index 0000000..32b7bfd
--- /dev/null
+++ b/share/knapsack.md
@@ -0,0 +1,7 @@
+# 背包问题
+背包问题是一个非常经典的计算机算法问题，我们可以通过各种算法来实现它，但是如何快速准确的得到解，是我们需要研究的问题。话不多说先看问题：有 N 件物品和一个容器为 V 的背包。放入第 i 件物品耗费的费用是 Ci，得到的 价值是 Wi。求解将哪些物品装入背包可使价值总和最大。
+
+## 分析问题
+
+
+## 递归
\ No newline at end of file
diff --git a/share/lakka.md b/share/lakka.md
deleted file mode 100644
index 1f3ebc9..0000000
--- a/share/lakka.md
+++ /dev/null
@@ -1,7 +0,0 @@
-# Lakka
-
-## balenaEtcher
-sudo /Applications/balenaEtcher.app/Contents/MacOS/balenaEtcher
-
-## 中文乱码
-/tmp/assets/xmb/monochrome
diff --git a/wallet.sketch b/wallet.sketch
new file mode 100644
index 0000000..e3ff8d2
Binary files /dev/null and b/wallet.sketch differ