coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/maximum-strictly-increasing-cells-in-a-matrix.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 495,
"dislikes": 16,
"likes": 496,
"dislikes": 17,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Number of Increasing Paths in a Grid\", \"titleSlug\": \"number-of-increasing-paths-in-a-grid\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[[3,1],[3,4]]\n[[1,1],[1,1]]\n[[3,1,6],[-9,5,7]]",
@@ -173,7 +173,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.7K\", \"totalSubmission\": \"33.3K\", \"totalAcceptedRaw\": 9658, \"totalSubmissionRaw\": 33267, \"acRate\": \"29.0%\"}",
"stats": "{\"totalAccepted\": \"9.7K\", \"totalSubmission\": \"33.3K\", \"totalAcceptedRaw\": 9677, \"totalSubmissionRaw\": 33310, \"acRate\": \"29.1%\"}",
"hints": [
"We can try to build the answer in a bottom-up fashion, starting from the smallest values and increasing to the larger values.",
"Going through the values in sorted order, we can store the maximum path we have seen so far for a row/column.",