topcoder 题目750分（赋答案）

最新推荐文章于 2021-08-21 14:47:52 发布

loveyon

最新推荐文章于 2021-08-21 14:47:52 发布

阅读量3.6k

点赞数

分类专栏：娱乐文章标签： string constraints each path parameters class

本文链接：https://blog.csdn.net/loveyon/article/details/550273

版权

给定一个字母网格和要查找的单词，计算从任意起点出发，按上下左右或对角线移动找到该单词的不同路径数量。若路径超过10亿种，则返回-1。约束包括网格和单词的大小，每个单元格只能使用一次，不能连续停留在同一位置。

摘要由CSDN通过智能技术生成

Problem Statement
????
You are given a String[] grid representing a rectangular grid of letters. You are also given a String find, a word you are to find within the grid. The starting point may be anywhere in the grid. The path may move up, down, left, right, or diagonally from one letter to the next, and may use letters in the grid more than once, but you may not stay on the same cell twice in a row (see example 6 for clarification).
You are to return an int indicating the number of ways find can be found within the grid. If the result is more than 1,000,000,000, return -1.
Definition
????
Class:
WordPath
Method:
countPaths
Parameters:
String[], String
Returns:
int
Method signature:
int countPaths(String[] grid, String find)
(be sure your method is public)
????