gpt4 book ai didi

java - 匹配完整字符串中包含分隔符的子字符串

转载 作者:太空宇宙 更新时间:2023-11-04 11:53:17 25 4
gpt4 key购买 nike

我不知道如何表达这个问题。长话短说,我想从 In: a (b) 行中提取两个字符串 (a, b)。几乎在所有情况下a=b,但为了以防万一,我将它们分开。问题:两个字符串都可以包含任何字符,包括 Unicode、空格、标点符号和括号。

1: In: ThisName (ThisName) is in this list
2: In: OtherName (With These) (OtherName (With These)) is in this list
3: In: Really Annoying (Because) Separators (Really Annoying (Because) Separators) is in this list

第 1 行,简单:^\w+:\s(?'a'.+?)\s\((?'b'.+)\) a:ThisName b:ThisName

第 2 行,与之前相同:a:OtherName b: WithThese) (OtherName (WithThese)

第 2 行,惰性:^\w+:\s(?'a'.+?)\s\((?'b'.+?)\) a:OtherName b:WithThese

3号线,总台

这可能吗?也许我需要走另一条路?我们知道那里需要一组括号。也许我必须走数学路线,计算括号的数量并找到该路线来确定哪个实际上应该包含 b?以某种方式计算每个打开和关闭的数量。

我一直在玩的东西:https://regex101.com/r/8YIweJ/2

顺便说一句,如果我可以更改输入格式,我肯定会这样做。

添加问题:如果这是不可能的,那么始终假设 a=b 是否会让这变得更容易?我想不出会怎样。

最佳答案

我的评论嵌入在 processInput 方法中。

public static void main(String[] args)
{
String input = "1: In: ThisName (ThisName) is in this list\n" +
"2: In: OtherName (With These) (OtherName (With These)) is in this list\n" +
"3: In: Really Annoying (Because) Separators (Really Annoying (Because) Separators) is in this list\n" +
"4: In: Not the Same (NotTheSame) is in this list\n" +
"5: In: A = (B) (A = (B)) is in this list\n" +
"6: In: A != (B) (A != B) is in this list\n";

for (String line : input.split("\n"))
{
processInput(line);
}
}


public static void processInput(String line)
{
// Parse the relevant part from the input.
Matcher inputPattern = Pattern.compile("(\\d+): In: (.*) is in this list").matcher(line);
if (!inputPattern.matches())
{
System.out.println(line + " is not valid input");
return;
}
String inputNum = inputPattern.group(1);
String aAndB = inputPattern.group(2);

// Check if a = b.
Matcher aEqualsBPattern = Pattern.compile("(.*) \\(\\1\\)").matcher(aAndB);
if (aEqualsBPattern.matches())
{
System.out.println("Input " + inputNum + ":");
System.out.println("a = b = " + aEqualsBPattern.group(1));
System.out.println();
return;
}

// Check if a and b have no parentheses.
Matcher noParenthesesPattern = Pattern.compile("([^()]*) \\(([^()]*)\\)").matcher(aAndB);
if (noParenthesesPattern.matches())
{
System.out.println("Input " + inputNum + ":");
System.out.println("a = " + noParenthesesPattern.group(1));
System.out.println("b = " + noParenthesesPattern.group(2));
System.out.println();
return;
}

// a and b have one or more parentheses in them.
// All you can do now is guess what a and b are.

// There is at least one " (" in the string.
String[] split = aAndB.split(" \\(");
for (int i = 0; i < split.length - 1; i++)
{
System.out.println("Possible Input " + inputNum + ":");
System.out.println("possible a = " + mergeParts(split, 0, i));
System.out.println("possible b = " + mergeParts(split, i + 1, split.length - 1));
System.out.println();
}
}


private static String mergeParts(String[] aAndBParts, int startIndex, int endIndex)
{
StringBuilder s = new StringBuilder(getPart(aAndBParts, startIndex));
for (int j = startIndex + 1; j <= endIndex; j++)
{
s.append(" (");
s.append(getPart(aAndBParts, j));
}
return s.toString();
}


private static String getPart(String[] aAndBParts, int j)
{
if (j != aAndBParts.length - 1)
{
return aAndBParts[j];
}
return aAndBParts[j].substring(0, aAndBParts[j].length() - 1);
}

执行上述代码输出:

Input 1:
a = b = ThisName

Input 2:
a = b = OtherName (With These)

Input 3:
a = b = Really Annoying (Because) Separators

Input 4:
a = Not the Same
b = NotTheSame

Input 5:
a = b = A = (B)

Possible Input 6:
possible a = A !=
possible b = B) (A != B

Possible Input 6:
possible a = A != (B)
possible b = A != B

关于java - 匹配完整字符串中包含分隔符的子字符串,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/41594662/

25 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com