判断矩阵我怎么可以创建字符串,可能是简单的矩阵包含以下组合正则表达式 - 从字符串
123456 ABC
123456AB1
123456AB12
123456AB123
123456
例如
if ("\\d + \\d + \\d + \\d + \\d + \\d
+ \\s
+ [a-zA-Z]+[a-zA-Z]+[a-zA-Z]") {
//passed variant from input in form 123456 ABC
} else if ("\\d + \\d + \\d + \\d + \\d + \\d
+ [a-zA-Z]+[a-zA-Z]+[a-zA-Z]
+ \\d") {
//passed variant from input in form 123456AB1
} else if ("\\d + \\d + \\d + \\d + \\d + \\d
+ [a-zA-Z]+[a-zA-Z]+[a-zA-Z]
+ \\d + \\d") {
//passed variant from input in form 123456AB12
} else if ("\\d + \\d + \\d + \\d + \\d + \\d
+ [a-zA-Z]+[a-zA-Z]+[a-zA-Z]
+ \\d + \\d + \\d") {
//passed variant from input in form 123456AB123
} else if ("\\d + \\d + \\d + \\d + \\d + \\d") {
//passed variant from input in form
} else {
//doesn't match
}
你能给出什么不应该匹配的例子? – Thomas
反对票是受欢迎的,也许我第一个不明白,例如这个线程的人http://stackoverflow.com/questions/7318469/java-recursive-repeated-deep-pattern-matching,:-) – mKorbel