Merge pull request #49 from imjma/problem-118

Add Problem 118
This commit is contained in:
halfrost
2020-08-19 08:21:08 +08:00
committed by GitHub
3 changed files with 105 additions and 0 deletions

View File

@ -0,0 +1,21 @@
package leetcode
func generate(numRows int) [][]int {
var result [][]int
for i := 0; i < numRows; i++ {
var row []int
for j := 0; j < i+1; j++ {
if j == 0 || j == i {
row = append(row, 1)
} else if i > 1 {
row = append(row, result[i-1][j-1]+result[i-1][j])
}
}
result = append(result, row)
}
return result
}

View File

@ -0,0 +1,52 @@
package leetcode
import (
"fmt"
"testing"
)
type question118 struct {
para118
ans118
}
// para 是参数
// one 代表第一个参数
type para118 struct {
numRows int
}
// ans 是答案
// one 代表第一个答案
type ans118 struct {
one [][]int
}
func Test_Problem118(t *testing.T) {
qs := []question118{
question118{
para118{2},
ans118{[][]int{{1}, {1, 1}}},
},
question118{
para118{5},
ans118{[][]int{{1}, {1, 1}, {1, 2, 1}, {1, 3, 3, 1}, {1, 4, 6, 4, 1}}},
},
question118{
para118{10},
ans118{[][]int{{1}, {1, 1}, {1, 2, 1}, {1, 3, 3, 1}, {1, 4, 6, 4, 1}, {1, 5, 10, 10, 5, 1}, {1, 6, 15, 20, 15, 6, 1}, {1, 7, 21, 35, 35, 21, 7, 1}, {1, 8, 28, 56, 70, 56, 28, 8, 1}, {1, 9, 36, 84, 126, 126, 84, 36, 9, 1}}},
},
}
fmt.Printf("------------------------Leetcode Problem 118------------------------\n")
for _, q := range qs {
_, p := q.ans118, q.para118
fmt.Printf("【input】:%v 【output】:%v\n", p, generate(p.numRows))
}
fmt.Printf("\n\n\n")
}

View File

@ -0,0 +1,32 @@
# [118. Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/
## 题目
Given a non-negative integer numRows, generate the first numRows of Pascal's triangle.
![](https://upload.wikimedia.org/wikipedia/commons/0/0d/PascalTriangleAnimated2.gif)
**Note:** In Pascal's triangle, each number is the sum of the two numbers directly above it.
**Example:**
```
Input: 5
Output:
[
[1],
[1,1],
[1,2,1],
[1,3,3,1],
[1,4,6,4,1]
]
```
## 题目大意
给一个正整数来生成一个帕斯卡三角形
## 解题思路