coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21: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/number-of-equivalent-domino-pairs.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 465,
"dislikes": 226,
"likes": 479,
"dislikes": 230,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[1,2],[2,1],[3,4],[5,6]]\n[[1,2],[1,2],[1,1],[1,2],[2,2]]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"46K\", \"totalSubmission\": \"99.5K\", \"totalAcceptedRaw\": 46043, \"totalSubmissionRaw\": 99515, \"acRate\": \"46.3%\"}",
"stats": "{\"totalAccepted\": \"46.8K\", \"totalSubmission\": \"101.2K\", \"totalAcceptedRaw\": 46814, \"totalSubmissionRaw\": 101151, \"acRate\": \"46.3%\"}",
"hints": [
"For each domino j, find the number of dominoes you've already seen (dominoes i with i < j) that are equivalent.",
"You can keep track of what you've seen using a hashmap."