Google编程大赛入围赛750分真题
来源:互联网 发布:乌鲁木齐视频教学软件 编辑:程序博客网 时间:2024/04/28 08:28
Google编程大赛入围赛750分真题 第五组
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.
This problem statement is the exclusive and proprietary property of TopCoder,
Inc. Any unauthorized use or reproduction of this information without the prior
written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder,
Inc. All rights reserved.
- Google编程大赛入围赛750分真题
- Google编程大赛入围赛750分真题
- Google编程大赛入围赛250分真题
- Google编程大赛入围赛750分真题(第五组) 之解法
- google编程大赛模拟题及入围赛真题
- Google编程之夏入围项目公布
- Google编程大赛解题一道
- Google 编程大赛 战火重燃!
- 《史仙》入围凤凰网首届原创文学大赛
- python代码(2)---google中国编程挑战赛入围赛真题HardDuplicateRemover(1000分)
- 我的google jam 入围赛之wordPath的一个解法
- mhtml5.com举办的HTML5游戏大赛入围作品名单
- 现代软件学院入围全国软件专业人才设计大赛(组图)
- 编程大赛
- 编程大赛
- 编程大赛编程大赛进入
- 2006Google大赛疑问
- 第22届全国青少年科技创新大赛入围终评项目清单
- 自己做的一个触发器小示例
- 一个广告从上向下翻滚的JS代码
- 路由协议
- DX SDK 更新。发个地址。保存一下
- 让Red Hat Linux支持NTFS
- Google编程大赛入围赛750分真题
- Google编程大赛入围赛250分真题
- aa
- AT&T语法
- ss
- 改变Oracle中XDB的http和ftp端口的配置
- 李煜词全集
- Java中的类反射机制
- 如何安装配置你的Tomcat5并绑定域名