-
Notifications
You must be signed in to change notification settings - Fork 1
/
119.杨辉三角-ii.java
49 lines (46 loc) · 1.06 KB
/
119.杨辉三角-ii.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
/*
* @lc app=leetcode.cn id=119 lang=java
*
* [119] 杨辉三角 II
*
* https://leetcode-cn.com/problems/pascals-triangle-ii/description/
*
* algorithms
* Easy (57.24%)
* Likes: 84
* Dislikes: 0
* Total Accepted: 23.3K
* Total Submissions: 40.3K
* Testcase Example: '3'
*
* 给定一个非负索引 k,其中 k ≤ 33,返回杨辉三角的第 k 行。
*
*
*
* 在杨辉三角中,每个数是它左上方和右上方的数的和。
*
* 示例:
*
* 输入: 3
* 输出: [1,3,3,1]
*
*
* 进阶:
*
* 你可以优化你的算法到 O(k) 空间复杂度吗?
*
*/
class Solution {
public List<Integer> getRow(int rowIndex) {
Integer[] integers = new Integer[rowIndex + 1];
integers[rowIndex] = 1;
for (int i = 1; i <= rowIndex; i++) {
int insertIdx = rowIndex - i;
integers[insertIdx] = 0;
for (int j = insertIdx; j < rowIndex; j++) {
integers[j] = integers[j] + integers[j + 1];
}
}
return Arrays.asList(integers);
}
}