update-doc-at-3.12

Author: DmrfCoder

LeetCode/Doc/doc-sample.md

@@ -0,0 +1,16 @@
+# candy
+
+<center>知识点：</center>
+
+
+## 题目描述
+
+
+
+## 解题思路
+
+
+
+## 代码
+
+[这里](../Code/n.py)

LeetCode/Doc/triange.md

@@ -0,0 +1,32 @@
+# candy
+
+<center>知识点：</center>
+
+
+## 题目描述
+
+Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.
+
+For example, given the following triangle
+
+[
+     [2],
+    [3,4],
+   [6,5,7],
+  [4,1,8,3]
+]
+
+The minimum path sum from top to bottom is11(i.e., 2 + 3 + 5 + 1 = 11).
+
+Note: 
+Bonus point if you are able to do this using only O(n) extra space, where n is the total number of rows in the triangle.
+
+
+
+## 解题思路
+
+
+
+## 代码
+
+[这里](../Code/n.py)