coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11: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/originData/[no content]closest-binary-search-tree-value-ii.json
View File

@@ -64,7 +64,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"114.1K\", \"totalSubmission\": \"194.3K\", \"totalAcceptedRaw\": 114115, \"totalSubmissionRaw\": 194299, \"acRate\": \"58.7%\"}",
"stats": "{\"totalAccepted\": \"114.1K\", \"totalSubmission\": \"194.3K\", \"totalAcceptedRaw\": 114121, \"totalSubmissionRaw\": 194305, \"acRate\": \"58.7%\"}",
"hints": [
"Consider implement these two helper functions:\r\n<ol type=\"i\"><li><code>getPredecessor(N)</code>, which returns the next smaller node to N.</li>\r\n<li><code>getSuccessor(N)</code>, which returns the next larger node to N.</li>\r\n</ol>",
"Try to assume that each node has a parent pointer, it makes the problem much easier.",