Java东西向和西向东发现者

Question

这段代码可以找到一个单词，如果它从左到右，我怎样才能找到一个单词从右到左和从上到下？

boolean findWE(String word) { 
    for (int r = 0; r < height; r++) { 
    for (int c = 0; c <= width - word.length(); c++) { 
     if (word.charAt(0) == grid[r][c]) { 
     boolean failed = false; 
     for (int i = 0; i < word.length() && !failed; i++) { 
      if (word.charAt(i) != grid[r][c + i]) { 
      failed = true; 
      } 
     } 
     if (!failed) { 
      System.out.printf("%s found WE at(%d,%d)\n", word, r, c); 
      return true; 
     } 
     } 
    } 
    } 
    return false; 
} 

Answer 1

因为这不是功课，你应该能够使用库函数来扭转一个字符串：

boolean findEW(String word) { 
    StringBuilder builder = new StringBuilder(); 

    // Why are your strings stored as a 2-dimensional character array?? 
    for(int r = 0; r < height; r++) { 
    builder.append(grid[r]); 
    builder.append("\n"); 
    } 

    builder.reverse(); 
    return builder.toString().contains(word); 
} 

或者，由于在“EDCBA”发现“ABC”是倒退与在“edcba”中找到“cba”一样，您可以执行以下操作：

boolean findEW(String word) { 
    return findWE(new StringBuilder(word).reverse()); 
}