leetCode #118 Pascal's Triangle

class Solution {
public:
vector<vector<int> > generate(int numRows) {
vector<vector<int> > result;
for (int i = 0; i < numRows; i++)
{
vector<int> currentRow;
if (i == 0)
currentRow.push_back(1);
else
{
for (int j = 0; j <= i; j++)
{
int currentDigit;
if (j == 0 || j == i)
{
currentDigit = 1;
}
else
{
currentDigit = result[i - 1][j] + result[i - 1][j - 1];
}
currentRow.push_back(currentDigit);
}
}
result.push_back(currentRow);

}
return result;
}
};