leetcode/lcci/08.07.Permutation I

08.07. Permutation I

中文文档

Description

Write a method to compute all permutations of a string of unique characters.

Example1:

 Input: S = "qwe"

 Output: ["qwe", "qew", "wqe", "weq", "ewq", "eqw"]

Example2:

 Input: S = "ab"

 Output: ["ab", "ba"]

Note:

1. All charaters are English letters.
2. 1 <= S.length <= 9

Solutions

Python3

Java

...