input: Write a function to generate and print Pascal's triangle given the number of rows. If the number of rows is 0, print nothing.
  def PascalTriangle(n) : 
        
      # An auxiliary array to store 
      # generated pscal triangle values 
      arr = [0 for i in range(n)] 
        
      # Iterate through every line and 
      # print integer(s) in it 
      for line in range(0, n) : 
            
          # Every line has number of  
          # integers equal to line  
          # number 
          for i in range (0, line + 1) : 
                
              # First and last values  
              # in every row are 1 
              if (i == 0 or i == line) : 
                  arr[i] = 1
                    
              # Other values are sum of  
              # values just above and  
              # left of above 
              else : 
                  arr[i] = arr[i] + arr[i - 1]  
                
          # Printing array in 
          # mantainence of order          
          for i in range (0, line + 1) : 
              print(arr[i], end =" ")  
          print()   
  
  # Test cases
  assert PascalTriangle(0) == None
  assert PascalTriangle(1) == "1 "
  assert PascalTriangle(2) == "1 1 \n1 2 "
  assert PascalTriangle(3) == "1 1 \n1 2 1 \n1 3 3 "
output: def PascalTriangle(n):
      for line in range(n):
          arr = [1] * (line + 1)
          for i in range(1, line):
              arr[i] = arr[i - 1] + arr[i]
          for num in arr:
              print(num, end=" ")
          print()