Javascript 在文本中查找德语电话号码

我想在文本中查找电话号码（用德语书写）。为了找到它们，我几乎完成了javascript正则表达式。 这是正则表达式：

(((((((00|\+)[0-9]{1,3}[ \-/]?)|0)[ ]?[1-9][0-9]{1,4})[ ]?[\-/]?[ ]?)|((((00|\+)[0-9]{1,3}[ ]?\()|\(0)(\)|[ ]?[1-9][0-9]{1,4}\))[ ]?[\-/]?[ ]?))[0-9]{1,7}([ \-/]?[0-9]{1,5}){0,4})

但现在我想补充两件事：

它应该排除少于9位数的电话号码。我试着 在整个表达式前面添加（？=（.*？\d）{9，}）。这个解决方案 适用于01234，但不适用于+33（33）3），如果有更多 数字如下。那我错在哪里

它应该排除没有任何空格的数字（如+49123123）。我怎么能意识到这一点

为了更好地理解我的意图，我准备了一个演示：

测试用例：

+33 (33) 3)44444444444 //the found string has only 5 digits, but it shouldn't be found because of (?=(.*?\d){9,})
+49123123123 //how can I exclude that, because there is no white space in the middle

// this is the part where I test all the other phone numbers, if you are interested in:

//it should match these phone numbers:
testword +49 30 12345-67 testword 
testword+49 (0)30 12345-67
(0)30 12345-67
(0)30 123 234
(0123)30 12345-67
test (021)30 123 234
s030 12345-67 dsd
(030) 12345 55 99testword 
testword   (030) 12345 44
0351 4640-123
09623 12 3 33
09234 1233
+49 123 1 2 12 31
0049 2123 1231
+1 3519 1231
0 30 / 12 34 56
0 30 / 12 34 56
030 / 12 34 56
0123 / 12312 123
testword  0178 1232231
+490 178 1232231
testword +36 (351)4740-991 testword
testword +36(351) 4740-991 testword
09623 12333 testword

should NOT match (with the reason why it shouldn't match):
+49123123123 //because there is no white space
01781232231 //because there is no white space
123456 //because it doesn't have at least 9 digits and no white space
123.123 //because it has a dot
12-12-12 //because there is no white space and there is more than one dash
12-12 -12-12-12 //because there is more than one dash
1990 - 2000 //because it doesn't have at least 9 digits
1990-2000 //because it doesn't have at least 9 digits and no white space
1990-91 //because it doesn't have at least 9 digits and no white space
123 //because it doesn't have at least 9 digits and no white space
+36 (351) 47(40-991 //because it has more than one left bracket
+36 (33) 3)4444
)40-991 //because it has more than one right bracket
+23+234 +2346 // because it has more than one plus sign
234 234 234 234   234 // because it has more than one white space in a row
123   123123 // because it has more than one white space in a row
01712123123
01234

---

我建议使用两种模式
首先捕获允许的字符：

(?!\s)(\+?[0-9 .\/()-]{8,}\d)\b        # optional `+`, 8 or more allowed chr's, digit

然后，获取您的标准：

^(?=.*\h)                              # has at least one whitespace
(?!.*\h\h)                             # does not see double whitespaces
(?!.*-.*-)                             # does not see more than one `-`
(?=(?:.*\d){9,})                       # has at least 9 digits
([^(\r\n]*\(?[^)\r\n]+\)?[^()\r\n]+)$  # sees optional proper parentheses

---

Cthulhu是真实的。我认为你应该在获得比赛后注意其他两个条件（或至少最小数字条件）。在单个正则表达式中检查所有这些参数将增大正则表达式的大小。（基本上，由于您无法在“展望”中检查您的状况，因此需要使用理论将其与当前的正则表达式混合）谢谢！好的，我将使用两种模式。顺便说一句，您的第二个正则表达式在Javascript中不起作用-->这是用于Javascript的：@thescheck使用它来代替

^（？=.*）（？！！.--）（？=（？：.*\d）{9，}）（[^（\r\n]*\（？[^）\r\n]+\？[^（）\r\n]+$