✨ Added solution to 119

Sathish Babu · Sathish Babu · commit 9fd63c937070 · 2020-06-02T19:26:16.000+05:30
diff --git a/src/0119.Pascals-Triangle-II/README.md b/src/0119.Pascals-Triangle-II/README.md
@@ -5,11 +5,17 @@
 
 ## Description
 
+Given a non-negative index k where k ≤ 33, return the kth index row of the Pascal's triangle.
+
+Note that the row index starts from 0.
+
+In Pascal's triangle, each number is the sum of the two numbers directly above it.
+
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: 3
+Output: [1,3,3,1]
 ```
 
 ## 题意
diff --git a/src/0119.Pascals-Triangle-II/Solution.go b/src/0119.Pascals-Triangle-II/Solution.go
@@ -1,5 +1,18 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(rowIndex int) []int {
+	if rowIndex == 0 {
+		return []int{1}
+	}
+	pt := make([]int, 0)
+	for i := 0; i < rowIndex; i++ {
+		tmp := make([]int, 0)
+		tmp = append(tmp, 1)
+		for j := 1; j < i+1; j++ {
+			tmp = append(tmp, pt[j]+pt[j-1])
+		}
+		tmp = append(tmp, 1)
+		pt = tmp
+	}
+	return pt
 }
diff --git a/src/0119.Pascals-Triangle-II/Solution_test.go b/src/0119.Pascals-Triangle-II/Solution_test.go
@@ -10,12 +10,12 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs int
+		expect []int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase", 0, []int{1}},
+		{"TestCase", 3, []int{1, 3, 3, 1}},
+		{"TestCase", 5, []int{1, 5, 10, 10, 5, 1}},
 	}
 
 	//	开始测试
