mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -11,10 +11,10 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Easy",
|
||||
"likes": 426,
|
||||
"likes": 434,
|
||||
"dislikes": 22,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Intersection of Two Arrays\", \"titleSlug\": \"intersection-of-two-arrays\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
|
||||
"similarQuestions": "[{\"title\": \"Intersection of Two Arrays\", \"titleSlug\": \"intersection-of-two-arrays\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Intersection of Multiple Arrays\", \"titleSlug\": \"intersection-of-multiple-arrays\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[1,2,3,4,5]\n[1,2,5,7,9]\n[1,3,4,5,8]\n[197,418,523,876,1356]\n[501,880,1593,1710,1870]\n[521,682,1337,1395,1764]",
|
||||
"categoryTitle": "Algorithms",
|
||||
"contributors": [],
|
||||
@@ -46,7 +46,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"63.6K\", \"totalSubmission\": \"79.6K\", \"totalAcceptedRaw\": 63643, \"totalSubmissionRaw\": 79634, \"acRate\": \"79.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"65.1K\", \"totalSubmission\": \"81.5K\", \"totalAcceptedRaw\": 65144, \"totalSubmissionRaw\": 81501, \"acRate\": \"79.9%\"}",
|
||||
"hints": [
|
||||
"Count the frequency of all elements in the three arrays.",
|
||||
"The elements that appeared in all the arrays would have a frequency of 3."
|
||||
|
Reference in New Issue
Block a user