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

6
leetcode/originData/count-numbers-with-unique-digits.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 854,
"dislikes": 1211,
"likes": 875,
"dislikes": 1228,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "2\n0",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"100.7K\", \"totalSubmission\": \"199.4K\", \"totalAcceptedRaw\": 100695, \"totalSubmissionRaw\": 199390, \"acRate\": \"50.5%\"}",
"stats": "{\"totalAccepted\": \"101.7K\", \"totalSubmission\": \"201K\", \"totalAcceptedRaw\": 101708, \"totalSubmissionRaw\": 200971, \"acRate\": \"50.6%\"}",
"hints": [
"A direct way is to use the backtracking approach.",
"Backtracking should contains three states which are (the current number, number of steps to get that number and a bitmask which represent which number is marked as visited so far in the current number). Start with state (0,0,0) and count all valid number till we reach number of steps equals to 10<sup>n</sup>.",