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:
小墨
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/originData/[no content]first-unique-number.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 425,
"likes": 432,
"dislikes": 21,
"isLiked": null,
"similarQuestions": "[]",
@@ -52,7 +52,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"70.2K\", \"totalSubmission\": \"134.4K\", \"totalAcceptedRaw\": 70180, \"totalSubmissionRaw\": 134442, \"acRate\": \"52.2%\"}",
"stats": "{\"totalAccepted\": \"71K\", \"totalSubmission\": \"135.8K\", \"totalAcceptedRaw\": 70984, \"totalSubmissionRaw\": 135781, \"acRate\": \"52.3%\"}",
"hints": [
"Use doubly Linked list with hashmap of pointers to linked list nodes. add unique number to the linked list. When add is called check if the added number is unique then it have to be added to the linked list and if it is repeated remove it from the linked list if exists. When showFirstUnique is called retrieve the head of the linked list.",
"Use queue and check that first element of the queue is always unique.",