From 7106c6f5160bd63008bf1e7ba391f2829d756f6f Mon Sep 17 00:00:00 2001
From: huangge1199 <huangge1199@hotmail.com>
Date: Fri, 9 Jul 2021 15:27:52 +0800
Subject: [PATCH] =?UTF-8?q?118:=E6=9D=A8=E8=BE=89=E4=B8=89=E8=A7=92?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../leetcode/editor/cn/PascalsTriangle.java   | 59 +++++++++++++++++++
 .../leetcode/editor/cn/PascalsTriangle.md     | 18 ++++++
 2 files changed, 77 insertions(+)
 create mode 100644 src/main/java/leetcode/editor/cn/PascalsTriangle.java
 create mode 100644 src/main/java/leetcode/editor/cn/PascalsTriangle.md

diff --git a/src/main/java/leetcode/editor/cn/PascalsTriangle.java b/src/main/java/leetcode/editor/cn/PascalsTriangle.java
new file mode 100644
index 0000000..4d6f0c6
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/PascalsTriangle.java
@@ -0,0 +1,59 @@
+//给定一个非负整数 numRows，生成杨辉三角的前 numRows 行。 
+//
+// 
+//
+// 在杨辉三角中，每个数是它左上方和右上方的数的和。 
+//
+// 示例: 
+//
+// 输入: 5
+//输出:
+//[
+//     [1],
+//    [1,1],
+//   [1,2,1],
+//  [1,3,3,1],
+// [1,4,6,4,1]
+//] 
+// Related Topics 数组 动态规划 
+// 👍 525 👎 0
+
+package leetcode.editor.cn;
+
+import java.util.ArrayList;
+import java.util.List;
+
+//118:杨辉三角
+public class PascalsTriangle{
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new PascalsTriangle().new Solution();
+    }
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+class Solution {
+    public List<List<Integer>> generate(int numRows) {
+        List<List<Integer>> result = new ArrayList<>();
+        for (int i = 0; i < numRows; i++) {
+            List<Integer> list = new ArrayList<>();
+            if(i==0){
+                list.add(1);
+                result.add(list);
+                continue;
+            }
+            List<Integer> bef = result.get(i-1);
+            for (int j = 0; j <= i; j++) {
+                if(j==0||j==i){
+                    list.add(1);
+                }else{
+                    list.add(bef.get(j-1)+ bef.get(j));
+                }
+            }
+            result.add(list);
+        }
+        return result;
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/PascalsTriangle.md b/src/main/java/leetcode/editor/cn/PascalsTriangle.md
new file mode 100644
index 0000000..055c716
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/PascalsTriangle.md
@@ -0,0 +1,18 @@
+<p>给定一个非负整数&nbsp;<em>numRows，</em>生成杨辉三角的前&nbsp;<em>numRows&nbsp;</em>行。</p>
+
+<p><img alt="" src="https://upload.wikimedia.org/wikipedia/commons/0/0d/PascalTriangleAnimated2.gif"></p>
+
+<p><small>在杨辉三角中，每个数是它左上方和右上方的数的和。</small></p>
+
+<p><strong>示例:</strong></p>
+
+<pre><strong>输入:</strong> 5
+<strong>输出:</strong>
+[
+     [1],
+    [1,1],
+   [1,2,1],
+  [1,3,3,1],
+ [1,4,6,4,1]
+]</pre>
+<div><div>Related Topics</div><div><li>数组</li><li>动态规划</li></div></div>\n<div><li>👍 525</li><li>👎 0</li></div>
\ No newline at end of file