LeetCode: Pascal's Triangle II

小失误，基本一次过

class Solution {
public:
    vector<int> getRow(int rowIndex) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int> pre;
        for (int i = 0; i <= rowIndex; i++) {
            vector<int> cur;
            if (!pre.size()) {
                cur.push_back(1);
                pre = cur;
            }
            else {
                for (int j = 0; j <= pre.size(); j++) {
                    if (!j || j == i) cur.push_back(1);
                    else cur.push_back(pre[j-1]+pre[j]);
                }
                pre = cur;
            }
        }
        return pre;
    }
};

 C#

public class Solution {
    public List<int> GetRow(int rowIndex) {
        List<int> ans = new List<int>();
        for (int i = 0; i <= rowIndex; i++) {
            List<int> cur = new List<int>();
            if (ans.Count == 0) {
                cur.Add(1);
                ans = new List<int>(cur.ToArray());
            }
            else {
                for (int j = 0; j <= ans.Count; j++) {
                    if ( j == 0 || j == i) cur.Add(1);
                    else cur.Add(ans[j-1] + ans[j]);
                }
                ans = new List<int>(cur.ToArray());
            }
        }
        return ans;
    }
}