Finding all the permutations of a string is by a well known Steinhaus–Johnson–Trotter algorithm. But if the string contains the repeated characters such asFinding all the permutations of a string is by
阅读背景：
查找字符串的所有唯一排列，而不生成重复
来源：互联网
分享到：
