Pascal’s Triangle Problem
Given a nonnegative 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:
Input: 3 Output: [1,3,3,1]
Follow up:
Could you optimize your algorithm to use only O(k) extra space?
And here is my solution:
I used JAVA code for implement this problem, this question is asked in LeetCode August Challenge Day 12
class Solution {
public List<Integer> getRow(int rowIndex) {
List<Integer> result=new ArrayList<>();
for(int i=0;i<rowIndex+1;i++)
result.add(1);
for(int i=1;i<rowIndex;i++)
for(int j=i;j>0;j--)
result.set(j,result.get(j)+result.get(j-1));
return result;
}
}
If you have any confusion about this code then feel free to ask in comment!
HappyCoding🎯
