给定一个字符串，将其组成的所有可能长度的字符串都列出来
在本节中，我们将看到如何生成任意长度的所有可能字符串，这将采用每个字符的组合来生成字符串。例如，如果字符串是ABC，则它将生成 - {A，B，C，AB，BA，BC，CB，CA，AC，ABC，ACB，BAC，BCA，CAB，CBA}
让我们看一个例子来理解。
算法
printAllString(str)
Begin n := length of the string str count is 2^n – 1 for each number 0 to count, do sub_str := empty string for j in range 0 to n, do if jth bit of the counter is set, then concatenate jth character of str with sub_str end if done repeat: print sub_string until next permutation of sub_string is not completed done End登录后复制
