LeetCode OJ——Pascal's Triangle II

http://oj.leetcode.com/problems/pascals-triangle-ii/

杨辉三角2，比杨辉三角要求的空间上限制Could you optimize your algorithm to use only O(k) extra space?其实计算当前行，也只用到前一行了。再前面的没有用。

class Solution {
public:
    vector<int> getRow(int rowIndex) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
 
        vector<int> onepiece;
        if(rowIndex<)
            return onepiece;
        //
        onepiece.push_back();
 
        if(rowIndex == )
            return onepiece;
        //
        onepiece.push_back();
        if(rowIndex == )
            return onepiece;
 
        //2...
        vector<int> ans(onepiece);
        for(int row = ;row<= rowIndex;row++)
        {
            onepiece = ans;
            for(int index = ;index < row;index++)
            {
                ans[index] = onepiece[index - ]+onepiece[index];
            }
            ans.push_back();
        }
        return ans;
    }
};