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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/make-lexicographically-smallest-array-by-swapping-elements.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"6.9K\", \"totalAcceptedRaw\": 2945, \"totalSubmissionRaw\": 6932, \"acRate\": \"42.5%\"}",
"stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"6.9K\", \"totalAcceptedRaw\": 2948, \"totalSubmissionRaw\": 6936, \"acRate\": \"42.5%\"}",
"hints": [
"Construct a virtual graph where all elements in <code>nums</code> are nodes and the pairs satisfying the condition have an edge between them.",
"Instead of constructing all edges, we only care about the connected components.",