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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/pseudo-palindromic-paths-in-a-binary-tree.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 944,
"likes": 946,
"dislikes": 34,
"isLiked": null,
"similarQuestions": "[]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"50.3K\", \"totalSubmission\": \"74.7K\", \"totalAcceptedRaw\": 50285, \"totalSubmissionRaw\": 74669, \"acRate\": \"67.3%\"}",
"stats": "{\"totalAccepted\": \"50.3K\", \"totalSubmission\": \"74.7K\", \"totalAcceptedRaw\": 50322, \"totalSubmissionRaw\": 74731, \"acRate\": \"67.3%\"}",
"hints": [
"Note that the node values of a path form a palindrome if at most one digit has an odd frequency (parity).",
"Use a Depth First Search (DFS) keeping the frequency (parity) of the digits. Once you are in a leaf node check if at most one digit has an odd frequency (parity)."