javascript - 糖果粉碎游戏逻辑

Question

<分区>

Answer 1

如果您使用如下所示的字符串表示形式，那么 preg_match() 可能会有所帮助。

$rows = array(
  '1321',
  '2223',
  '1322',
  '3332',
  '3222',
  '12312322222222123123'
);


foreach($rows as $row) {
  echo $row .' 3+ repeating values: ';
  if(preg_match('/(1{3,}|2{3,}|3{3,})/',$row,$matches)) {
    echo 'Yes';
    echo ', found at pos. ' . strpos($row, $matches[0]);
    echo ' (' . $matches[0] . ')';
  } else {
    echo 'No';
  }

  echo "\n";
};

输出是:

1321 3+ repeating values: No
2223 3+ repeating values: Yes, found at pos. 0 (222)
1322 3+ repeating values: No
3332 3+ repeating values: Yes, found at pos. 0 (333)
3222 3+ repeating values: Yes, found at pos. 1 (222)
12312322222222123123 3+ repeating values: Yes, found at pos. 6 (22222222)

您可以使用 http://sandbox.onlinephpfunctions.com/code/c183683c96af513e9a4b539ed8f713a685f34541 处的代码

使用 PREG_OFFSET_CAPTURE 标志的替代版本，如@Mark Ba​​ker 所建议的

foreach($rows as $row) {
  echo $row .' 3 repeating values: ';
  if(preg_match('/(1{3,}|2{3,}|3{3,})/',$row,$matches,PREG_OFFSET_CAPTURE)) {
    list($match, $pos) = $matches[0];
    echo "Yes, found at pos. $pos ($match)\n";
  } else {
    echo "No\n";
  }
};