NeetCode #674LC-120Medium1-D Dynamic Programming
← Back to All Problems#674 · #120 · Triangle(三角形最小路径和)
📌 Problem Statement & Constraints
Given a
triangle array, return the minimum path sum from the top to the bottom, where each step moves to an adjacent number in the row below. Constraints: 1 <= triangle.length <= 200, -10^4 <= triangle[i][j] <= 10^4.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!