Redian新闻
>
大牛看过来~Word Search这题的优化解是?
avatar
大牛看过来~Word Search这题的优化解是?# JobHunting - 待字闺中
r*o
1
Word Search这题的优化解是?看面经里也有经常考到,但是手边的资料好像只有暴力
解!!
Given a 2D board and a word, find if the word exists in the grid.
The word can be constructed from letters of sequentially adjacent cell,
where "adjacent" cells are those horizontally or vertically neighboring. The
same letter cell may not be used more than once.
For example,
Given board =
[
["ABCE"],
["SFCS"],
["ADEE"]
]
word = "ABCCED", -> returns true,
word = "SEE", -> returns true,
word = "ABCB", -> returns false.
请大牛出场~~
avatar
l*g
2
我不是大牛!
我觉得可以用suffixtree来做,或者A* search
好久没碰算法了,哈哈。
avatar
r*o
3
A* 算法的话,怎么判断最优路径呢?
相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。