LeetCode 119. Pascal’s Triangle II

119. Pascal’s Triangle II
My Submissions QuestionEditorial Solution
Total Accepted: 72147 Total Submissions: 224801 Difficulty: Easy
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?

class Solution {
public:vector<int> getRow(int rowIndex) {vector<int> v(rowIndex + 1);v[0] = 1;for(int i = 1; i <= rowIndex; i++) {v[i] = (long long int)v[i - 1] *(long long int)(rowIndex - i + 1) / i;}return v;}
};

LeetCode 119. Pascal’s Triangle II相关推荐

[LeetCode]119.Pascal's Triangle II
版权声明:本文为博主原创文章,未经博主允许不得转载. https://blog.csdn.net/SunnyYoona/article/details/43562603 题目 Given an ind ...
LeetCode - Easy - 119. Pascal‘s Triangle II
Topic Array Description https://leetcode.com/problems/pascals-triangle-ii/ Given an integer rowIndex ...
leetcode python3 简单题119. Pascal's Triangle II
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百一十九题 (1)题目英文: Given a non-negative ind ...
119. Pascal's Triangle II (Graph; WFS)
Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3 ...
Leet Code OJ 119. Pascal's Triangle II [Difficulty: Easy]
题目: Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return ...
119. Pascal's Triangle II
Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3 ...
[LeetCode]119.Pascal#39;s Triangle II
题目 Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [ ...
LeetCode Pascal's Triangle II
Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3 ...
C#LeetCode刷题之#119-杨辉三角 II（Pascal‘s Triangle II）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3690 访问. 给定一个非负索引 k,其中 k ≤ 33,返回杨辉 ...

LeetCode 119. Pascal’s Triangle II

LeetCode 119. Pascal’s Triangle II相关推荐

最新文章

热门文章