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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/[no content]closest-binary-search-tree-value-ii.json
View File

@@ -64,7 +64,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"6.7K\", \"totalAcceptedRaw\": 4398, \"totalSubmissionRaw\": 6717, \"acRate\": \"65.5%\"}",
"stats": "{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"6.7K\", \"totalAcceptedRaw\": 4405, \"totalSubmissionRaw\": 6728, \"acRate\": \"65.5%\"}",
"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.",