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-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode-cn/originData/[no content]number-of-ways-to-build-house-of-cards.json
View File

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 0,
"likes": 1,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"41\", \"totalSubmission\": \"85\", \"totalAcceptedRaw\": 41, \"totalSubmissionRaw\": 85, \"acRate\": \"48.2%\"}",
"stats": "{\"totalAccepted\": \"97\", \"totalSubmission\": \"175\", \"totalAcceptedRaw\": 97, \"totalSubmissionRaw\": 175, \"acRate\": \"55.4%\"}",
"hints": [
"If a row has k triangles, how many cards does it take to build that row? It takes 3 * k - 1 cards.",
"If you still have i cards left, and on the previous row there were k triangles, what are the possible ways to build the current row? You can start at 1 triangle and continue adding more until you run out of cards or reach k - 1 triangles."