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

>>阅读原文<<