2021年1月31日
[LeetCode] 1102. Path With Maximum Minimum Value
摘要： Given a matrix of integers A with R rows and C columns, find the maximum score of a path starting at [0,0] and ending at [R-1,C-1]. The score of a pat 阅读全文
posted @ 2021-01-31 15:25 CNoodle 阅读(727) 评论(0) 推荐(0)
[LeetCode] 1631. Path With Minimum Effort
摘要： You are a hiker preparing for an upcoming hike. You are given heights, a 2D array of size rows x columns, where heights[row][col] represents the heigh 阅读全文
posted @ 2021-01-31 08:08 CNoodle 阅读(1187) 评论(0) 推荐(0)