Google中国编程挑战赛－题目解答

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)

Constraints
-
grid will contain between 1 and 50 elements, inclusive.
-
Each element of grid will contain between 1 and 50 uppercase ('A'-'Z')
letters, inclusive.
-
Each element of grid will contain the same number of characters.
-
find will contain between 1 and 50 uppercase ('A'-'Z') letters,
inclusive.
Examples
0)

{"ABC",
"FED",
"GHI"}
"ABCDEFGHI"
Returns: 1
There is only one way to trace this path. Each letter is used exactly
once.
1)

{"ABC",
"FED",
"GAI"}
"ABCDEA"
Returns: 2
Once we get to the 'E', we can choose one of two directions for the
final 'A'.
2)

{"ABC",
"DEF",
"GHI"}
"ABCD"
Returns: 0
We can trace a path for "ABC", but there's no way to complete a path to
the letter 'D'.
3)

{"AA",
"AA"}
"AAAA"
Returns: 108
We can start from any of the four locations. From each location, we can
then move in any of the three possible directions for our second
letter, and again for the third and fourth letter. 4 * 3 * 3 * 3 = 108.
4)

{"ABABA",
"BABAB",
"ABABA",
"BABAB",
"ABABA"}
"ABABABBA"
Returns: 56448
There are a lot of ways to trace this path.
5)

{"AAAAA",
"AAAAA",
"AAAAA",
"AAAAA",
"AAAAA"}
"AAAAAAAAAAA"
Returns: -1
There are well over 1,000,000,000 paths that can be traced.
6)

{"AB",
"CD"}
"AA"
Returns: 0
Since we can't stay on the same cell, we can't trace the path at all.












Java的解答

public class WordPath
{
public int countPaths(String[] grid, String find)
{
mx = grid.length;
my = grid[0].length();
charRect = new char[grid.length][];
for(int i=0;i<charRect.length;i++)
charRect[i] = grid[i].toCharArray();
finds = find.toCharArray();

int count = 0;
char first = finds[0];
for(int x=0;x<charRect.length;x++)
for(int y=0;y<charRect[x].length;y++)
if (charRect[x][y] == first)
count += countPaths(0,x,y);

if (count > 1000000000)
return -1;
return count;
}

char[][] charRect = null;
char[] finds = null;
int mx = 0;
int my = 0;

private int countPaths(int ind,int cx,int cy)
{
if (ind == finds.length - 1)
return 1;

int count = 0;
char nextChar = finds[ind+1];

for(int dx=-1;dx<=1;dx++)
{
for(int dy=-1;dy<=1;dy++)
{
if (dx==0 && dy == 0)
continue;

int x = cx + dx;
int y = cy + dy;
if (x >=0 && x< mx && y >= 0 && y < my)
{
if (charRect[x][y] == nextChar)
count += countPaths(ind+1,x,y);
}
}
}

return count;
}