coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-24 14:28:56 +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

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

@@ -173,7 +173,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"7K\", \"totalAcceptedRaw\": 2219, \"totalSubmissionRaw\": 7042, \"acRate\": \"31.5%\"}",
"stats": "{\"totalAccepted\": \"2.4K\", \"totalSubmission\": \"7.3K\", \"totalAcceptedRaw\": 2358, \"totalSubmissionRaw\": 7268, \"acRate\": \"32.4%\"}",
"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.",