leetcode+杨辉三角

点击打开连接 class Solution { public: vector<int> getRow(int rowIndex) { vector<int> result(rowIndex+1, 1); if(rowIndex < 2) return result; for(int i=2; i<=rowIndex; i++){

>>阅读原文<<