coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +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

2
leetcode/originData/count-good-triplets-in-an-array.json
View File

@@ -173,7 +173,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"9.7K\", \"totalAcceptedRaw\": 3267, \"totalSubmissionRaw\": 9677, \"acRate\": \"33.8%\"}",
"stats": "{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"9.7K\", \"totalAcceptedRaw\": 3278, \"totalSubmissionRaw\": 9700, \"acRate\": \"33.8%\"}",
"hints": [
"For every value y, how can you find the number of values x (0 ≤ x, y ≤ n - 1) such that x appears before y in both of the arrays?",
"Similarly, for every value y, try finding the number of values z (0 ≤ y, z ≤ n - 1) such that z appears after y in both of the arrays.",