Given a <strong>triangle</strong> array, return the minimum path sum from top to bottom.. For each step, you may move to an adjacent number of the row below. More formally, if you are on index i on the current row, you may move to either index i or index i + 1 on the next row.. Example 1: Input: <strong>triangle</strong> = [[2],[3,4],[6,5,7],[4,1,8,3]] Output: 11 Explanation: The <strong>triangle</strong> looks like: 2 3 4 6 5 7 4 1 8 3 …
leetcode.com