使用正则表达式匹配较长字符串时的StackOverflowError-优化[duplicate]

Question

我正在使用Regex来匹配传入文件内容，以检测具有以下模式的ID

AXXXXXXXXXX-MID-XX (Where X = numeric values with length 10 and 2)

下面是Java代码-

String pattern1="(.|\n|\r)*(A[0-9]{10}-MID-[0-9]{2})(.|\n|\r)*";
if(file_content.matches(pattern1)) {
//...Do something <-- The code never reaches here.

}

Answer 1

您不必要地使用了(.\n\r)*。下面给出了一个更干净、更有效的方法：

import java.util.regex.Matcher;
import java.util.regex.Pattern;

public class Main {
    public static void main(String[] args) {
        Pattern pattern = Pattern.compile("A[0-9]{10}-MID-[0-9]{2}");
        String fileContent = "A1234567890-MID-12";// Replace it with actual content
        Matcher matcher = pattern.matcher(fileContent);
        while (matcher.find()) {
            String id = matcher.group();// If you want to grab the ID
            System.out.println(id);
            // ...do something
        }
    }
}

输出：

A1234567890-MID-12