问题:
Given an index k, return the kth row of the Pascal's triangle.
For example, given k = 3,
Return [1,3,3,1]
.
Note:
Could you optimize your algorithm to use only O(k) extra space。
解决:
①与Pascal's Triangle相似的思路,采用上层相加得到下层;
public class Solution {
public List<Integer> getRow(int rowIndex) {
List<Integer> res = new ArrayList<Integer>();
if (rowIndex < 0) return new ArrayList<Integer>();
int[] lspre = new int[rowIndex+1];
int[] lscur = new int[rowIndex+1];
int[] ls;
lspre[0] = 1;
for (int i = 1; i <= rowIndex; i ++) {
lscur[0] = 1;
for (int j = 1; j < i; j ++) {
lscur[j] = lspre[j-1] + lspre[j];
}
lscur[i] = 1;
ls = lspre;
lspre = lscur;
lscur = ls;
}
for (int i = 0; i <= rowIndex; i ++) {
res.add(lspre[i]);
}
return res;
}
}
②因为只需要输出杨辉三角的一行,为节省空间,可以从后向前扫描的方法,这样就不需要记录前一行,直接在上层记录的基础上覆盖即可。耗时2ms。
public class Solution {
public List<Integer> getRow(int rowIndex) {
List<Integer> list = new ArrayList<>(rowIndex + 1);
list.add(1);
for (int i = 1;i <= rowIndex ;i ++ ) {
for (int j = i;j >= 0;j --) {
if (j == 0){
list.set(j,1);
}else if(j == i){
list.add(1);
}else{
list.set(j,list.get(j - 1) + list.get(j));
}
}
}
return list;
}
}