Python 基础知识简单

打印字符串的所有排列

“打印字符串的所有排列”问题的详细指南和 Python 实现。

问题陈述

简单

编写一个函数 permutations(s),它接受字符串 s 并返回 s 中字符的所有唯一排列的排序列表。每个排列都是所有字符的重新排列。返回的列表必须按字典顺序(字母顺序)排序。

约束条件
  • 1 <= len(s) <= 8
  • s contains only lowercase English letters

示例

Example 1
Input
s = 'abc'
Output
['abc', 'acb', 'bac', 'bca', 'cab', 'cba']
Explanation

All 3! = 6 rearrangements of 'a', 'b', 'c', sorted alphabetically.

Example 2
Input
s = 'ab'
Output
['ab', 'ba']
Explanation

Two characters give 2! = 2 permutations.

Example 3
Input
s = 'aab'
Output
['aab', 'aba', 'baa']
Explanation

There are only 3 unique permutations since 'a' is repeated.

Need a Hint?
考虑使用特定于递归的数据结构,例如集合或堆。
Edge Cases to Watch
  • 空输入结构
  • 单元素输入
  • 大数值范围

准备好解决了吗?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

在编辑器中打开
Found this breakdown helpful?

PyRun is built and maintained by an independent solo developer. If this helped your interview prep, consider buying a coffee!

Buy me a coffee

推荐的 Python 资源

通过相关的交互式教程、备忘单和代码比较来扩展您的知识。