为列表中所有字符串组合的可能输出生成逻辑

尝试这个。已编辑：添加了代码注释。import java.util.ArrayList;import java.util.Iterator;import java.util.LinkedList;import java.util.List;import java.util.Scanner;public class Main {    public static void main(String args[]) {        Scanner scan = new Scanner(System.in);        System.out.println("Enter the code you want to check: ");        String input = scan.next();        scan.close();        List<String> codes = new ArrayList<>();        codes.add("ABC(Q,E,1)EEE");        codes.add("ABDCE(E,Z,X)E");        codes.add("B(A,1)AAEEE");        codes.add("R(1,2,3,4,5)RT(U,M,N,B,V,H)(Q,E,R,F,G,H)(R,Z)");        codes.add("B(A,1)AA(E,Z)EE");        for (Iterator<String> i = codes.iterator(); i.hasNext();) {            String code = i.next();            List<String> codePossiblity = generatePossibilities(code);            // check if the input is in the list of all the possibility            for (String s : codePossiblity) {                if (s.contains(input)) {                    System.out.println("True: This code is present");                }            }        }    }    /* This method removes the parenthesis and generates all the possibilities.     * This method assumes that the parenthesis always comes in pair, thus     * for every opening parenthesis ["("] there is a closing parenthesis [")"]     * Example if the "code" is [A(WX)C(YZ)] then it will generate AWCY, AWCZ, AXCY and AXCZ      *      * @param code - The string which contains parenthesis.     * @return a list of all the possibilities     */    public static List<String> generatePossibilities(String code) {        // This will hold the left part of the possibleCodes (part before "(")        List<String> possibleCodeList = new LinkedList<>();        String s = code;        boolean first = true;        // Loop while an open parenthesis ["("] can be found        while (s.contains("(")) {            // Retrieve from the string the first substring where "(" starts and ends with ")"            // In the example, in the first iteration will be "WX"            // in the second iteration this will be "YZ"            String inside = s.substring(s.indexOf("(") + 1, s.indexOf(")"));            // Retrieve the list inside the "(" and ")"            // In the example, in the first iteration the list will have "W", "X"            // in the second iteration the list will have "Y", "Z"            String[] listOfChoices = inside.split(",");            // This will hold the right part of the possibleCodes (part after ")")            List<String> listOfCombinations = new LinkedList<>();            // Loop all the possible choices            for (String choice : listOfChoices) {                // If it is the first iteration then you need to include those characters before the "("                if (first) {                    // add the characters before the "(" and the remaining characters after ")"                    // In the example, the first iteration of this list ("W", "X") will add "AWC(YZ)"                    // the second iteration of this list ("W", "X") will add "AXC(YZ)"                    listOfCombinations.add(s.substring(0, s.indexOf("(")) + choice + s.substring(s.indexOf(")") + 1));                }                 // Else just start with choice                else {                    // add the remaining characters after ")"                    // In the example, the first iteration of this list ("Y", "Z") will add "Y"                    // the second iteration of this list ("Y", "Z") will add "Z"                    listOfCombinations.add(choice + s.substring(s.indexOf(")") + 1));                }            }            // Remove the subtring before the ")", in the example this will be "C(YZ)"            s = s.substring(s.indexOf(")") + 1);            // If it is the first iteration then you just need to assign the listOfCombinations directly to possibleCodeList,             // since possibleCodeList is still empty            if (first) {                possibleCodeList = listOfCombinations;                first = false;            }             // Else combine the left and right part            else {                List<String> codePossiblity2 = new LinkedList<>();                // Iterate though all the list of possible codes since we want all the elements in the list to be concatenated with the right half of the string                // The list will have "AWC(YZ)" and "AXC(YZ)"                for (String possibleCodes : possibleCodeList) {                    // Iterate the possible combinations of the right half of the original string (the second pair of "()")                    // The list will have "Y" and "Z"                    for (String sTmp : listOfCombinations) {                        // Replace the string which are inside the "()" in the left half of the original string.                        // Replace it with the right half of the original string                        // In the string of "AWC(YZ)" replace "(YZ)" with "Y"                        // In the string of "AWC(YZ)" replace "(YZ)" with "Z"                        // In the string of "AXC(YZ)" replace "(YZ)" with "Y"                        // In the string of "AXC(YZ)" replace "(YZ)" with "Z"                        String t = possibleCodes.replace("(" + inside + ")", sTmp);                        // add the newly created string to codePossiblity2                        codePossiblity2.add(t);                    }                    // At the end of the loop above codePossiblity2 will have these values                    // AWCY, AWCZ, AXCY and AXCZ                }                // overwrite the possibleCodeList since we have now a new left part of the string                possibleCodeList = codePossiblity2;            }        }        return possibleCodeList;    }}

为列表中所有字符串组合的可能输出生成逻辑

2回答