Notice
250x250
Recent Posts
Recent Comments
Link
목록2024/04/26 (1)
넘치게 채우기
[LeetCode] 1289. Minimum Falling Path Sum II
https://leetcode.com/problems/minimum-falling-path-sum-ii/description/Leetcode - Minimum Falling Path Sum II문제 유형 : 다이나믹 프로그래밍문제 난이도 : Hard 문제Given an n x n integer matrix grid, return the minimum sum of a falling path with non-zero shifts.A falling path with non-zero shifts is a choice of exactly one element from each row of grid such that no two elements chosen in adjacent rows are in the same..
PS/LeetCode
2024. 4. 26. 11:11