coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +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/n-th-tribonacci-number.json
View File

@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"573.9K\", \"totalSubmission\": \"903.9K\", \"totalAcceptedRaw\": 573888, \"totalSubmissionRaw\": 903912, \"acRate\": \"63.5%\"}",
"stats": "{\"totalAccepted\": \"574K\", \"totalSubmission\": \"904.1K\", \"totalAcceptedRaw\": 573980, \"totalSubmissionRaw\": 904074, \"acRate\": \"63.5%\"}",
"hints": [
"Make an array F of length 38, and set F[0] = 0, F[1] = F[2] = 1.",
"Now write a loop where you set F[n+3] = F[n] + F[n+1] + F[n+2], and return F[n]."