GoLang Solution For LeetCode Problem: Pascals Triangle
Solving Pascals Triangle in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Given a non-negative integer numRows, generate the first numRows of Pascal's triangle.
Note: In Pascal's triangle, each number is the sum of the two numbers directly above it.
Input: 5 Output: [ , [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ]
See the full details of the problem Pascals Triangle at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go