確定是否存在三個(gè) X 的垂直線形式

使用現(xiàn)代正則表達(dá)式風(fēng)格，如 PCRE/PHP、Perl、.NET 或類似的，可以確定如果 ASCII“圖像”中存在由三個(gè) X 組成的垂直線。

考慮以下正則表達(dá)式：

(?xm)                    # ignore comments and whitespace, ^ matches beginning of line
^                        # beginning of line
(?:
    .                    # any character except \n
    (?=                  # lookahead
        .*+\n            # go to next line
        ( ?+ . )       # add a character to the 1st capturing group
        .*+\n            # next line
        ( ?+ . )       # add a character to the 2nd capturing group
    )
)*?                      # repeat as few times as needed
X .*+\n                  # X on the first line and advance to next line
?+                     # if 1st capturing group is defined, use it, consuming exactly the same number of characters as on the first line
X .*+\n                  # X on the 2nd line and advance to next line
?+                     # if 2st capturing group is defined, use it, consuming exactly the same number of characters as on the first line
X                        # X on the 3rd line

此表達(dá)式使用具有自引用捕獲組的前瞻來(lái)計(jì)算X 之前每行的字符數(shù)。它嘗試通過(guò)匹配前瞻中指定的條件來(lái)匹配垂直格式中的三個(gè) X 字符。

在線演示： https://regex101 .com/r/Xb5FXl/2

計(jì)算三個(gè) X 的垂直線形成的數(shù)量

雖然它不能在像 Perl 和 PCRE 這樣的有限后向的正則表達(dá)式風(fēng)格中直接解決，但可以通過(guò)操作匹配的字符串來(lái)間接確定計(jì)數(shù)。

以下解決方案通過(guò)匹配和計(jì)算匹配中出現(xiàn)三個(gè) X 的部分中的字符數(shù)來(lái)修改 m.buettner 的“部分 PCRE 解決方案”。

^
(?:
    (?:                   # match .+? characters
        .
        (?=               # counting the same number on the following two lines
            .*+\n
            ( ?+ . )
            .*+\n
            ( ?+ . )
        )
    )+?
    (?<= X )              # till the above consumes an X
    (?=                   # that matches the following conditions
        .*+\n
        ?+
        (?<= X )
        .*+\n
        ?+
        (?<= X )
    )
    (?=                   # count the number of matches
        .*+\n
        ( ?+ . )        # the number of matches = length of 
    )
)*                        # repeat as long as there are matches on this line
.*\n?                     # remove the rest of the line

此表達(dá)式與前一個(gè)表達(dá)式匹配相同的格式，但它添加了第三個(gè)捕獲組并計(jì)算該組中匹配字符的長(zhǎng)度。通過(guò)僅用第三個(gè)捕獲組的內(nèi)容替換匹配項(xiàng)，生成的字符串長(zhǎng)度表示三 X 形式的數(shù)量。

Perl 中的示例用法：

$in =~ s/regex//gmx;
$count = length $in;

在線演示： https://regex101.com/r/iqxY1a/1

測(cè)試用例：

Test #0:
--------------------
X
X
X

result: 1 (X)


Test #1:
--------------------
..X....
..X....
..X....

result: 1 (.)


Test #2:
--------------------
..X.X..
..X.X..
....X..

result: 1 (.)


Test #3:
--------------------
..X....
..X....
...X...

result: 0 ()


Test #4:
--------------------
..X....
...X...
..X....

result: 0 ()


Test #5:
--------------------
....X..
.X..X..
.X.....

result: 0 ()


Test #6:
--------------------
.X..X..
.X.X...
.X.X...

result: 1 (.)


Test #7:
--------------------
.X..X..
.X..X..
.X..X..

result: 2 (.X)


Test #8:
--------------------
XXX
XXX
XXX

result: 3 (XXX)


Test #9:
--------------------
X.X.X
XXXXX
XXXXX
.X.X.

result: 5 (XXXXX)


Test #10:
--------------------
1....X.......
2..X..X...X....
3X.X...X..X.....
4X....XXXXXX.....
5X..XXX...........
6.....X..........
7.........X....X
8..X......X....X....
9..X......X....X....X...
A....X.....
B.X..X..
C.....
XXX
XXX
XXX
.

result: 8 (3458.XXX)

以上是正則表達(dá)式能否檢測(cè) ASCII 圖像中垂直線結(jié)構(gòu)中的三個(gè) X？的詳細(xì)內(nèi)容。更多信息請(qǐng)關(guān)注PHP中文網(wǎng)其他相關(guān)文章！