word-search

标签：use   hose   const   cal   return   exists   call   struct   for   

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", -> returnstrue, word ="SEE", -> returnstrue, word ="ABCB", -> returnsfalse.

word-search

标签：use   hose   const   cal   return   exists   call   struct   for   

原文地址：http://www.cnblogs.com/Skyecan/p/7651397.html