coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 16:31:42 +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-cn/originData/permutation-i-lcci.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"34.2K\", \"totalSubmission\": \"42.2K\", \"totalAcceptedRaw\": 34170, \"totalSubmissionRaw\": 42168, \"acRate\": \"81.0%\"}",
"stats": "{\"totalAccepted\": \"34.2K\", \"totalSubmission\": \"42.2K\", \"totalAcceptedRaw\": 34178, \"totalSubmissionRaw\": 42178, \"acRate\": \"81.0%\"}",
"hints": [
"方法1：假设你有abc的所有排列。你怎么用它来得到abcd的所有排列？",
"方法1：abc的排列组合表示abc的所有组合方式。现在，我们要创建abcd的所有组合方式。选择abcd的特定组合，如bdca。这个bdca字符串也代表abc的一种排列方式：删除d，你会得到bca。那么给定字符串bca，你是否可以创建包含d 的所有“相关”排列组合？",