Leetcode之Pascal's Triangle II 问题

问题描述： Given an index k, return the kth row of the Pascal's triangle. Note: Could you optimize your algorithm to use only O(k) extra space? 示例： For example, given k = 3, Return [1,3,3,1]. 问题来源：Pascal's

>>阅读原文<<