C++/Java/JavaScript/Python：“找单词”游戏，找一找，考验你的眼力

后端

2023-11-27 03:05:38

找单词游戏：用 C++、Java、JavaScript 和 Python 来寻找隐藏的单词

在文字游戏中，你见过“找单词”游戏吗？在二维字符数组中寻找隐藏的单词，是一件很有趣也很考验眼力的活动。今天，我们就来用 C++、Java、JavaScript 和 Python 四种语言来实现一个“找单词”游戏。

游戏规则

游戏规则很简单：给定一个字符串和一个二维字符数组，如果字符串存在于二维字符数组中，则按字符串的字符顺序输出字符串每个字符所在单元格的位置下标字符串；如果找不到，返回字符串“N”。

代码实现

下面是用 C++、Java、JavaScript 和 Python 四种语言实现的“找单词”游戏代码示例：

C++

#include <iostream>
#include <vector>

using namespace std;

bool findWord(vector<vector<char>>& board, string word) {
  int m = board.size();
  int n = board[0].size();

  for (int i = 0; i < m; i++) {
    for (int j = 0; j < n; j++) {
      if (board[i][j] == word[0]) {
        if (dfs(board, word, i, j, 0)) {
          return true;
        }
      }
    }
  }

  return false;
}

bool dfs(vector<vector<char>>& board, string word, int i, int j, int index) {
  if (index == word.size()) {
    return true;
  }

  if (i < 0 || i >= board.size() || j < 0 || j >= board[0].size() || board[i][j] != word[index]) {
    return false;
  }

  char temp = board[i][j];
  board[i][j] = '0';

  bool found = dfs(board, word, i - 1, j, index + 1) ||
              dfs(board, word, i + 1, j, index + 1) ||
              dfs(board, word, i, j - 1, index + 1) ||
              dfs(board, word, i, j + 1, index + 1);

  board[i][j] = temp;

  return found;
}

int main() {
  vector<vector<char>> board = {
    {'A', 'B', 'C', 'E'},
    {'S', 'F', 'C', 'S'},
    {'A', 'D', 'E', 'E'}
  };

  string word = "ABCCED";

  cout << findWord(board, word) << endl;

  return 0;
}

Java

import java.util.Arrays;

class Solution {
    public boolean findWord(char[][] board, String word) {
        for (int i = 0; i < board.length; i++) {
            for (int j = 0; j < board[0].length; j++) {
                if (board[i][j] == word.charAt(0)) {
                    if (dfs(board, word, i, j, 0)) {
                        return true;
                    }
                }
            }
        }

        return false;
    }

    private boolean dfs(char[][] board, String word, int i, int j, int index) {
        if (index == word.length()) {
            return true;
        }

        if (i < 0 || i >= board.length || j < 0 || j >= board[0].length || board[i][j] != word.charAt(index)) {
            return false;
        }

        char temp = board[i][j];
        board[i][j] = '0';

        boolean found = dfs(board, word, i - 1, j, index + 1) ||
                dfs(board, word, i + 1, j, index + 1) ||
                dfs(board, word, i, j - 1, index + 1) ||
                dfs(board, word, i, j + 1, index + 1);

        board[i][j] = temp;

        return found;
    }
}

JavaScript

const findWord = (board, word) => {
  for (let i = 0; i < board.length; i++) {
    for (let j = 0; j < board[0].length; j++) {
      if (board[i][j] === word[0]) {
        if (dfs(board, word, i, j, 0)) {
          return true;
        }
      }
    }
  }

  return false;
};

const dfs = (board, word, i, j, index) => {
  if (index === word.length) {
    return true;
  }

  if (i < 0 || i >= board.length || j < 0 || j >= board[0].length || board[i][j] !== word[index]) {
    return false;
  }

  const temp = board[i][j];
  board[i][j] = '0';

  const found = dfs(board, word, i - 1, j, index + 1) ||
                dfs(board, word, i + 1, j, index + 1) ||
                dfs(board, word, i, j - 1, index + 1) ||
                dfs(board, word, i, j + 1, index + 1);

  board[i][j] = temp;

  return found;
};

Python

def findWord(board, word):
    for i in range(len(board)):
        for j in range(len(board[0])):
            if board[i][j] == word[0]:
                if dfs(board, word, i, j, 0):
                    return True

    return False


def dfs(board, word, i, j, index):
    if index == len(word):
        return True

    if i < 0 or i >= len(board) or j < 0 or j >= len(board[0]) or board[i][j] != word[index]:
        return False

    temp = board[i][j]
    board[i][j] = '0'

    found = dfs(board, word, i - 1, j, index + 1) or \
           dfs(board, word, i + 1, j, index + 1) or \
           dfs(board, word, i, j - 1, index + 1) or \
           dfs(board, word, i, j + 1, index + 1)

    board[i][j] = temp

    return found