[LeetCode] 120. Triangle - 문제풀이
Description 주어진 삼각형형태의 array 목록에서 맨아래로 갈 수 있는 최단거리를 반환하는 문제입니다. Given a triangle 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: triangle = [[2],[3,4],[6,5,7],[4,1,8,3]] Output: 11 Expl..