Java 正则表达式模式至少包含一个字母

Question

我正在尝试从文本中提取字母数字序列。该序列的长度可以是五个或六个字符，必须以数字开头和结尾，并且中间至少有一个字母，例如:25D212、4WX07、 8FZW5、2T784、25XR47

这就是我能够整合的内容

[0-9][[0-9]|[a-zA-Z]]{3,4}[0-9]

此解决方案的问题在于它也匹配

888888(至少不满足一个字符限制)

Answer 1

广义
根据排列(如下)，看起来可以推广到这个

 # (?i)\d(?=\d{0,3}[a-z])[a-z\d]{3,4}\d

 (?i)
 \d                   # A digit
 (?= \d{0,3} [a-z] )  # a letter in the next 1 to 4 characters
 [a-z\d]{3,4}         # 3 to 4 digits or letters
 \d                   # A digit

排列

 # (?i)\d(?:[a-z][a-z\d]{2,3}|\d[a-z][a-z\d]{1,2}|\d\d[a-z][a-z\d]{0,1}|\d\d\d[a-z])\d

 (?i)
 \d 
 (?:
      [a-z] 
      [a-z\d]{2,3} 
   |  
      \d 
      [a-z] 
      [a-z\d]{1,2} 
   |  
      \d\d 
      [a-z] 
      [a-z\d]{0,1} 
   |  
      \d\d\d 
      [a-z] 
 )
 \d

输入

for example: 25D212, 4WX07, 8FZW5, 2T784, 25XR47

输出

 **  Grp 0 -  ( pos 13 , len 6 ) 
25D212  

 **  Grp 0 -  ( pos 21 , len 5 ) 
4WX07  

 **  Grp 0 -  ( pos 28 , len 5 ) 
8FZW5  

 **  Grp 0 -  ( pos 28 , len 5 ) 
8FZW5  

 **  Grp 0 -  ( pos 42 , len 6 ) 
25XR47