首頁(yè) 猿問(wèn) 如何優(yōu)化正則表達(dá)式？

如何優(yōu)化正則表達(dá)式？

JavaScript

慕碼人8056858 2021-06-02 17:09:43

我正在嘗試運(yùn)行以下 regex ^(.*\s)*(([A-Z]{2,3}(?:-[0-9]+){3}))((\s)+.*)?$，但我得到了大約 100+ 個(gè)字符的字符串超時(shí)。我在 JS 中運(yùn)行了這個(gè)正則表達(dá)式，我也嘗試在 regex101.com 中運(yùn)行它。我試圖匹配的是“ABC-12312-121231-12312”，它可以以任何字符串開(kāi)頭和后跟。這是我的 JS 代碼：const regexTransaction = /^(.*\s)*(([A-Z]{2,3}(?:-[0-9]+){3}))((\s)+.*)?$/var resTransaction = new RegExp(regexTransaction,'g').exec(encodedMsg)console.log(resTransaction)我真的很感激任何幫助。

查看完整描述

1 回答

紫衣仙女

TA貢獻(xiàn)1839條經(jīng)驗(yàn) 獲得超15個(gè)贊

這兩者似乎都具有相當(dāng)?shù)男阅?。第一個(gè)假設(shè)每個(gè)塊中的數(shù)字?jǐn)?shù)量已知（5、6、5）。第二個(gè)是原始正則表達(dá)式的清理版本，它接受 3 個(gè)由連字符分隔的任意數(shù)量的數(shù)字序列。

// assumes ABC - 5 digits - 6 digits - 5 digits

const regex = /([A-Z]{2,3}-[\d]{5}-[\d]{6}-[\d]{5})/g;

// your original regex with unnecessary stuff stripped out.

// notice that this captures the second item with 999 appended that the first expression doesn't get.

const regex2 = /([A-Z]{2,3}(?:-[0-9]+){3})/g;

const input = "asfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312999afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12345afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-99999-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfdsasfsfdasABC-12312-121231-12312afsasfsdfds";

console.log(input.match(regex));

console.log(input.match(regex2));

反對(duì) 回復(fù) 2021-06-03