【LeetCode】Pascal’s Triangle

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