leetcode 119. Pascal's Triangle II(杨辉三角II) python3 两种思路（老土但高效的list拼接 / 优雅的map()方法）

全部Leetcode题目不按期汇总在 Github, 欢迎你们批评指正，讨论交流。 '''' 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. In Pascal's trian

>>阅读原文<<