急急急，求字符串替换code

[为爱冰封的心]

给一个字符串如“a,b,c“，和特殊符号$，要求得到所以有组合“a,b,c”,“a,b,$”,“a,$,c”,“$,b,c”,“a,$,$",“$,b,$”,“$,$,c”,“$,$,$”.

[jiekou0704]

如果只有3个字母的话 笨方法也能写出来。只是多了找规律就难得。。写了一下代码就不帖了。希望lz能找到一个好的方法。。。参考参考

[oh_Maxy]

暂时想到一个笨办法： abc看成0a0b0c0，然后用$挨个替换0，然后再去掉0，这样所有可插入位置都会出现一遍。

[panzhixiong_cn]

给你个方向，可以考虑正则表达式

[日知己所无]

import java.util.*;

public class GenerateCombination {
    public static void main(String[] args) {
        try {
            Scanner scanner = new Scanner(System.in);
            String  scannerNextLine = "";
            while ((scannerNextLine = scanner.nextLine()) != null &&
                    scannerNextLine.length() > 0) {

                SortedSet<String> combinationSet = new TreeSet<String>();
                generateCombination(scannerNextLine, "$", combinationSet);
                printCombination(combinationSet);

            }
            scanner.close();
        } catch (Exception e) {
            System.out.println(e);
        } finally {
        }
    }

    public static void generateCombination(
            final String inputString,
            final String replaceSymbol,
            Set <String> combinationSet) {

        String allReplaceSymbolString = "";
        for (int inputStringIndex = 0; inputStringIndex < inputString.length(); inputStringIndex++) {
            allReplaceSymbolString = allReplaceSymbolString.concat(replaceSymbol);
        }

        combinationSet.add(inputString);
        while (!combinationSet.contains(allReplaceSymbolString)) {
            SortedSet<String> appendSet = new TreeSet<String>();

            for (String combinationString : combinationSet) {
                char[] combinationCharArray = combinationString.toCharArray();
                for (int combinationCharIndex = 0;
                         combinationCharIndex < combinationCharArray.length;
                         combinationCharIndex++) {
                    char combinationChar = combinationCharArray[combinationCharIndex];
                    combinationCharArray[combinationCharIndex] = replaceSymbol.charAt(0);
                    appendSet.add(String.valueOf(combinationCharArray));
                    combinationCharArray[combinationCharIndex] = combinationChar;
                }
            }

            combinationSet.addAll(appendSet);
        }
    }

    public static void printCombination(final Set<String> combinationSet) {
        for (String combinationString : combinationSet) {
            System.out.println(combinationString);
        }
    }
}

输入： abc 输出： $$$ $$c $b$ $bc a$$ a$c ab$ abc

[日知己所无]

稍微调整一下printCombination，应该不会很难吧

[放纵的青春]

话不多说 上代码：

public static void main(String[] args) {
		String str = "a,b,c,d,e";
		List<String> strs=new ArrayList<String>();
		for (int i = 0; i < str.length(); i++) {
			if (i%2==0) {
				strs.add(str.replace(""+str.toCharArray()[i], "$"));
			}
		}
		System.out.println(strs);
	}

效果图：

[放纵的青春]

我擦 我看错题目了啊

[放纵的青春]

引用 4 楼 Android_iPhone 的回复:

import java.util.*;

public class GenerateCombination {
    public static void main(String[] args) {
        try {
            Scanner scanner = new Scanner(System.in);
            String  scannerNextLine = "";
            while ((scannerNextLine = scanner.nextLine()) != null &&
                    scannerNextLine.length() > 0) {

                SortedSet<String> combinationSet = new TreeSet<String>();
                generateCombination(scannerNextLine, "$", combinationSet);
                printCombination(combinationSet);

            }
            scanner.close();
        } catch (Exception e) {
            System.out.println(e);
        } finally {
        }
    }

    public static void generateCombination(
            final String inputString,
            final String replaceSymbol,
            Set <String> combinationSet) {

        String allReplaceSymbolString = "";
        for (int inputStringIndex = 0; inputStringIndex < inputString.length(); inputStringIndex++) {
            allReplaceSymbolString = allReplaceSymbolString.concat(replaceSymbol);
        }

        combinationSet.add(inputString);
        while (!combinationSet.contains(allReplaceSymbolString)) {
            SortedSet<String> appendSet = new TreeSet<String>();

            for (String combinationString : combinationSet) {
                char[] combinationCharArray = combinationString.toCharArray();
                for (int combinationCharIndex = 0;
                         combinationCharIndex < combinationCharArray.length;
                         combinationCharIndex++) {
                    char combinationChar = combinationCharArray[combinationCharIndex];
                    combinationCharArray[combinationCharIndex] = replaceSymbol.charAt(0);
                    appendSet.add(String.valueOf(combinationCharArray));
                    combinationCharArray[combinationCharIndex] = combinationChar;
                }
            }

            combinationSet.addAll(appendSet);
        }
    }

    public static void printCombination(final Set<String> combinationSet) {
        for (String combinationString : combinationSet) {
            System.out.println(combinationString);
        }
    }
}

输入： abc 输出： $$$ $$c $b$ $bc a$$ a$c ab$ abc

他那个是加上，号的 这个好像也满足不了哦

[Kunzeal]

感觉用递归就可以呀，递归来打印全排列...

[日知己所无]

import java.util.*;

public class GenerateCombination {
    public static void main(String[] args) {
        try {
            Scanner scanner = new Scanner(System.in);
            String  scannerNextLine = "";
            while ((scannerNextLine = scanner.nextLine()) != null &&
                    scannerNextLine.length() > 0) {

                SortedSet<String> combinationSet = new TreeSet<String>();
                generateCombination(scannerNextLine, "$", combinationSet);
                printCombination(combinationSet);

            }
            scanner.close();
        } catch (Exception e) {
            System.out.println(e);
        } finally {
        }
    }

    public static void generateCombination(
            final String inputString,
            final String replaceSymbol,
            Set <String> combinationSet) {

        String allReplaceSymbolString = "";
        for (int inputStringIndex = 0; inputStringIndex < inputString.length(); inputStringIndex++) {
            allReplaceSymbolString = allReplaceSymbolString.concat(replaceSymbol);
        }

        combinationSet.add(inputString);
        while (!combinationSet.contains(allReplaceSymbolString)) {
            SortedSet<String> appendSet = new TreeSet<String>();

            for (String combinationString : combinationSet) {
                char[] combinationCharArray = combinationString.toCharArray();
                for (int combinationCharIndex = 0;
                         combinationCharIndex < combinationCharArray.length;
                         combinationCharIndex++) {
                    char combinationChar = combinationCharArray[combinationCharIndex];
                    combinationCharArray[combinationCharIndex] = replaceSymbol.charAt(0);
                    appendSet.add(String.valueOf(combinationCharArray));
                    combinationCharArray[combinationCharIndex] = combinationChar;
                }
            }

            combinationSet.addAll(appendSet);
        }
    }

    public static void printCombination(final Set<String> combinationSet) {
        String printString = "";
        for (String combinationString : combinationSet) {
            printString += "\"" + combinationString + "\",";
        }
        if (printString.length() > 0) {
            System.out.println(printString.substring(0, printString.length() - 1) + ".");
        }
    }
}

好吧，这次输出完全满足题目要求了 输入：abc 输出："$$$","$$c","$b$","$bc","a$$","a$c","ab$","abc".