每日一题;
今天做的也相对简单,主要是空间的限制,注意边界位置就够了;
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?
public class Solution {
public List<Integer> getRow(int rowIndex) {
List<Integer> results = new ArrayList<Integer>();
List<Integer> temp1 = new ArrayList<Integer>();
if(rowIndex<0){
return null;
}
temp1.add(1);
temp1.add(0);
for(int i=1;i<=rowIndex;i++){
if(i%2 == 1){
results.clear();
results.add(1);
for(int j = 1;j<=i;j++){
results.add(temp1.get(j)+temp1.get(j-1));
}
results.add(0);
}else {
temp1.clear();;
temp1.add(1);
for(int j = 1;j<=i;j++){
temp1.add(results.get(j)+results.get(j-1));
}
temp1.add(0);
}
}
if(rowIndex%2==0){
temp1.remove(temp1.size()-1);
return temp1;
}else {
results.remove(results.size()-1);
return results;
}
}
}