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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/check-if-it-is-a-good-array.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 240,
"dislikes": 269,
"likes": 241,
"dislikes": 271,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[12,5,7,23]\n[29,6,10]\n[3,6]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"12.9K\", \"totalSubmission\": \"22.3K\", \"totalAcceptedRaw\": 12880, \"totalSubmissionRaw\": 22281, \"acRate\": \"57.8%\"}",
"stats": "{\"totalAccepted\": \"12.9K\", \"totalSubmission\": \"22.3K\", \"totalAcceptedRaw\": 12887, \"totalSubmissionRaw\": 22291, \"acRate\": \"57.8%\"}",
"hints": [
"Eq. ax+by=1 has solution x, y if gcd(a,b) = 1.",
"Can you generalize the formula?. Check Bézout's lemma."