119.杨辉三角-ii

/*
 * @lc app=leetcode.cn id=119 lang=typescript
 *
 * [119] 杨辉三角 II
 */

// @lc code=start
function getRow(rowIndex: number): number[] {
	let res: number[][] = [];
	for (let i = 0; i < rowIndex + 1; i++) {
		res[i] = [];
		res[i][0] = 1;
		for (let j = 0; j < i; j++) {
			let count = res[i - 1][j - 1] + res[i - 1][j];
			res[i][j] = isNaN(count) ? 1 : count;
		}
		res[i][i] = 1;
	}
	return res[rowIndex];
}
// @lc code=end