* only if both of them contain the same characters the same number of times. * One string s1 is a permutation of other string s2 only if sorted (s1) = sorted (s2). * In order to check this, we can ...

The permutations of a single-letter string is a set of one element, the single-letter string.

LeetCode各题解法分析~（Java and Python）. Contribute to YutingZ92/LeetCode-1 development by creating an account on GitHub.