Pascal's Triangle II
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.
Example:
Follow up:
Could you optimize your algorithm to use only O(k) extra space?
Solution
Last updated