coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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

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

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"28.1K\", \"totalSubmission\": \"40.8K\", \"totalAcceptedRaw\": 28064, \"totalSubmissionRaw\": 40842, \"acRate\": \"68.7%\"}",
"stats": "{\"totalAccepted\": \"28.1K\", \"totalSubmission\": \"40.8K\", \"totalAcceptedRaw\": 28068, \"totalSubmissionRaw\": 40846, \"acRate\": \"68.7%\"}",
"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)."