coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/semi-ordered-permutation.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"27.7K\", \"totalSubmission\": \"44.1K\", \"totalAcceptedRaw\": 27728, \"totalSubmissionRaw\": 44150, \"acRate\": \"62.8%\"}",
"stats": "{\"totalAccepted\": \"27.7K\", \"totalSubmission\": \"44.2K\", \"totalAcceptedRaw\": 27734, \"totalSubmissionRaw\": 44163, \"acRate\": \"62.8%\"}",
"hints": [
"Find the index of elements 1 and n.",
"Let x be the position of 1 and y be the position of n. the answer is x + (n-y-1) if x < y and x + (n-y-1) - 1 if x > y."