Question

我怎么能够把从低地到高端的扼杀与一切可能的产出结合起来?

例如,我有“钟表”bc;它必须提供上门的所有可能产出,以显示这套指示数为产出:

 abC , aBc, aBC , Abc ABc , AbC , ABC

Answer 1

这里是这样做的算法:

 String input = "abc";
 int length = input.length();
 for (int i = 1;i < 2^input.length();i++){
     String bitString = convert value of i into bits (eg, 1 = 001 , 2 = 010)
     //Iterate through length of bitString
     StringBuffer newString = "";
     for (int j = 1;j < bitString.length();j++){
        if(bitString.charAt(j)== 1 ){
           newString.append(convertToUpperCase(input.charAt(j));
        }else{
           newString.append(input.charAt(j));
        }
     }
     print newString
 }

Answer 2

Convert your String to an arrays String.toArray() and loop through it!
I think it s homework, so I won t give you the complete answer.

String.to LowerCase()>>和

友情链接