#!/usr/bin/env python
# coding: utf-8

# <h1>118. Pascal's Triangle</h1>
# <hr>
# 
# <!--Copy Paste Leetcode statement between-->
# <p>Given a non-negative integer&nbsp;<em>numRows</em>, generate the first <em>numRows</em> of Pascal's triangle.</p>
# 
# <p><img alt="" src="./img1.gif" style="height:240px; width:260px"><br>
# <small>In Pascal's triangle, each number is the sum of the two numbers directly above it.</small></p>
# 
# <p><strong>Example:</strong></p>
# 
# <pre><strong>Input:</strong> 5
# <strong>Output:</strong>
# [
#      [1],
#     [1,1],
#    [1,2,1],
#   [1,3,3,1],
#  [1,4,6,4,1]
# ]
# </pre>
# <!--Copy Paste Leetcode statement between-->
# 
# <p>&nbsp;</p>
# <a href="https://leetcode.com/problems/pascals-triangle/">Source</a> 
# <hr>
# 
# <h4>Code</h4>

# In[1]:


def pascal_triangle(numRows):
    pass


# <h4>Check</h4>

# In[2]:


pascal_triangle(5)


# In[3]:


pascal_triangle(15)


# <hr>
# <h4>Follow up:</h4>
# <p>Solve it both recursively and iteratively.</p>
# 
# <h4>Code</h4>

# In[4]:


def pascal_triangle(numRows):
    pass


# <h4>Check</h4>

# In[5]:


pascal_triangle(5)


# In[6]:


pascal_triangle(15)