GoLang Solution For LeetCode Problem: Triangle
Solving Triangle in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.
For example, given the following triangle
[ , [3,4], [6,5,7], [4,1,8,3] ]
See the full details of the problem Triangle at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go