[ad_1]
\n<\/p>\n
If all you have to do is to out put true or false depending on the user input, you can convert your code strings to regular expressions and check if input matches the list of regex. <\/p>\n
Steps:<\/p>\n
Convert each element in your codes list to a regex<\/p>\n
\/\/ convert “ABC(Q,E,1)EEE” to “ABC[QE1]EEE” to match each string starting with ABC followed by one of [QE1] and ending with EEE <\/p>\n
\/\/”R(1,2,3,4,5)RT(U,M,N,B,V,H)(Q,E,R,F,G,H)(R,Z)” to “R[12345]RT[UMNBVH][QERFGH][RZ]”<\/p>\n
etc<\/p>\n<\/li>\n
Check if input matches one of the regexes<\/p>\n<\/li>\n<\/ul>\n
Example:<\/p>\n
public static void main(String[] args) {\n\n Scanner scan = new Scanner(System.in);\n System.out.println(\"Enter the code you want to check: \");\n String input = scan.next();\n\n List<String> codes = new ArrayList<>();\n codes.add(\"ABC(Q,E,1)EEE\");\n codes.add(\"ABDCE(E,Z,X)E\");\n codes.add(\"B(A,1)AAEEE\");\n codes.add(\"R(1,2,3,4,5)RT(U,M,N,B,V,H)(Q,E,R,F,G,H)(R,Z)\");\n codes.add(\"B(A,1)AA(E,Z)EE\");\n\n \/\/list to store the modified strings\n List<String> modifiedCodes = new ArrayList<>();\n \/\/for each string in list find if there is a pattern like '('some chars')'\n Pattern p = Pattern.compile(\"\\\\(.*\\\\)\");\n for (Iterator<String> i = codes.iterator(); i.hasNext();) {\n String code = i.next();\n StringBuffer sb = new StringBuffer ();\n Matcher m = p.matcher(code);\n while (m.find()) { \n String match = m.group();\n \/\/if found a match replace '(' and ')' with '[' and ']' and remove commas\n m.appendReplacement(sb, match.replace('(', '[').replace(')', ']').replace(\",\", \"\"));\n }\n m.appendTail(sb);\n \/\/add modified string to list\n modifiedCodes.add(sb.toString());\n } \n\n boolean codeIsPresent = false;\n for(String code: modifiedCodes){\n \/\/check if input matches one of the regex in the list 'modifiedCodes'\n if (input.matches(code)) {\n codeIsPresent = true;\n System.out.println(\"True: This code is present\");\n break;\n }\n }\n if(!codeIsPresent){\n System.out.println(\"Code not found\");\n }\n}\n<\/code><\/pre>\nEDIT<\/strong><\/p>\n\nhow can we print the list of all the combinations of the string from
\n which it is getting the output? say, I just have a string
\n “BA(1,2,3)QW(A-Z,0-9)” and I want all the possible combinations of it<\/p>\n<\/blockquote>\n
The above question from your coments is slightly difference as the original post, it might be better if you post a new question. You can create your own algorithm with somekind of tree structure to solve the issue but it can be very hackish and messy. I would suggest to use a 3rd party libraray like generex<\/a> if possible. You can download the jar from the maven repo here<\/a>. With generex you can have all your possible commbinations:<\/p>\npublic static void main(String args[]){\n \/\/change your input to a regular expression\n \/\/\"BA(1,2,3)QW(A-Z,0-9)\" to \"BA[1-3]QW[A-Z][0-9]\"\n Generex generex = new Generex(\"BA[1-3]QW[A-Z][0-9]\");\n List<String> matchedStrs = generex.getAllMatchedStrings();\n matchedStrs.forEach(System.out::println);\n} \n<\/code><\/pre>\n<\/p><\/div>\n