Gem Squares 程序是怎么写的呢

Question

Problem Description
You are given a board with 8×8 squares. In each square, there can be either a colored gem or no gem at all. Gems with different colors are represented by different integers. It is guaranteed that there are no more than two consecutive gems with the same color either in a row or in a column, and that there is not any gem above a blank square.

........
........
........
........
........
..43366.
..121556
44212335

For two neighboring squares, you can exchange the gems.

........
........
........
........
........
..43366.
..111556
44222335

If there are more than two consecutive gems with the same color in a row or in a column after exchange, these gems will be taken away simultaneously. Note that a gem could be counted both in its row and in its column; refer to the sample test cases for details.

........
........
........
........
........
..43366.
.....556
44...335

If there is no gem under a gem, the gem will fall to the square below.

........
........
........
........
........
.....66.
.....556
44433335

After all gems have fallen down to the lowest place, the procedure will be repeated. If there are more than two gems with the same color in a row or in a column, these gems will be taken away simultaneously. Then some gems will fall to the squares below, if there are no gems under those gems.

........
........
........
........
........
.....66.
.....556
.......5

........
........
........
........
........
........
.....666
.....555

........
........
........
........
........
........
........
........

The procedure will be repeated until there is no gem that can be taken away.

Given a board with 8*8 squares, you task is to determine whether all gems can be taken away by a single exchange or not.

Input
The input consists of several test cases. Each test case will be eight lines, and each line contains eight characters. If in a square there is no gem, ‘.’ is used to identify it, otherwise an integer k is used to identify the gem’s color, 1≤k≤9.

There is a blank line between two consecutive test cases.

End of input is indicated by a line consisting of 0.

Output
For each test case, output a single line. If all gems can be taken away by a single exchange, output “Yes”; otherwise output “No”.

Sample Input
........
........
........
........
........
..43366.
..121556
44212335

........
........
........
.2......
.2.22...
.1.11...
.2.22...
.2.22...

12121212
21212121
12121212
21212121
12121212
21212121
12121212
21212121

........
........
........
........
........
...96...
...96...
.996966.

0

Sample Output
Yes
Yes
No
Yes

Answer 1

以下回答参考 皆我百晓生、券券喵儿 等免费微信小程序相关内容作答，并由本人整理回复。

# Gem Squares程序实现
gem_squares <- function(board) {
  # 将字符串转换为整数矩阵
  board_matrix <- matrix(unlist(strsplit(board, "\n")), nrow = 8)
  
  # 检查是否有连续相同的颜色的两颗或更多
  has_consecutive_colors <- function(row, col) {
    prev_color <- NA
    consec_count <- 0
    
    for (i in 1:ncol(row)) {
      current_color <- row[i]
      
      if (current_color != prev_color && consec_count > 0) {
        return(TRUE)
      }
      
      if (current_color == prev_color) {
        consec_count <- consec_count + 1
      } else {
        prev_color <- current_color
        consec_count <- 1
      }
    }
    
    return(FALSE)
  }
  
  for (i in 1:7) {
    for (j in 1:7) {
      if (board_matrix[i][j] == " ") {
        # 如果是空白格，则检查上下左右是否相邻有相同颜色的两颗或更多
        left_row <- board_matrix[(i - 1):i, j]
        right_row <- board_matrix[(i + 1):i + 1, j]
        top_col <- board_matrix[i, (j - 1):j]
        bottom_col <- board_matrix[i, (j + 1):j + 1]
        
        if ((has_consecutive_colors(left_row, j) || 
            has_consecutive_colors(right_row, j) ||
            has_consecutive_colors(top_col, i) ||
            has_consecutive_colors(bottom_col, i))) {
          return(TRUE)
        }
      }
    }
  }
  
  return(FALSE)
}

# 测试用例
test_cases <- list(
  c(".....", ".....", "..43366.", "..121556", "44212335"),
  c(".....", ".2......", ".2.22...", ".1.11...", ".2.22...", "12121212"),
  c(".....", "21212121", "12121212", "21212121", "12121212", "21212121"),
  c(".996966", ".......", ".......", ".......", ".......", "969696")
)

for (i in seq_along(test_cases)) {
  result <- gem_squares(test_cases[[i]])
  print(paste("Test Case", i+1, ": ", result))
}

这段代码实现了Gem Squares问题的R语言实现。它首先将输入的字符串转换为整数矩阵，并检查是否有连续相同的颜色的两颗或更多。如果存在这样的情况，则返回TRUE；否则，继续检查其他行和列。最后，输出每个测试用例的结果。