首页| JavaScript| HTML/CSS| Matlab| PHP| Python| Java| C/C++/VC++| C#| ASP| 其他|
购买积分 购买会员 激活码充值

您现在的位置是:虫虫源码 > 其他 > Where s Waldorf? Given a m by n grid of letters, ( 1<=m, n<=50), and...

Where s Waldorf? Given a m by n grid of letters, ( 1<=m, n<=50), and...

  • 资源大小:114.13 kB
  • 上传时间:2021-06-30
  • 下载次数:0次
  • 浏览次数:0次
  • 资源积分:1积分
  • 标      签: Windows开发 c++

资 源 简 介

Where s Waldorf? Given a m by n grid of letters, ( 1<=m, n<=50), and a list of words, find the location in the grid at which the word can be found. A word matches a straight, uninterrupted line of letters in the grid. A word can match the letters in the grid regardless of case (i.e. upper and lower case letters are to be treated as the same). The matching can be done in any of the eight directions either horizontally, vertically or diagonally through the grid.

文 件 列 表

10010
10010 Where's Waldorf.pdf
10010.cpp
10010.exe
VIP VIP
0.203514s