amazon 面筋题怎么做？# JobHunting - 待字闺中
S*C
1 楼
最后20分钟左右做题：
Given a 3 by 3 array filled with single character, and a dictionary, print
out all the words the given characters can form
that are valid in the dictionary. Words can be different lengths. Dictionary
有一个function: ispresent().
LZ背景弱 对于没见过的题目无法直接想到方法。小哥给提示，说你先想2 by 2 array
。我就跟他说暴力方法。他说
对，you are on the right direction。在他的提示下我给了暴力做法。小哥不断给支
持和鼓励。最后时间不多了
代码写了个大概，小哥就让问问题了。
Given a 3 by 3 array filled with single character, and a dictionary, print
out all the words the given characters can form
that are valid in the dictionary. Words can be different lengths. Dictionary
有一个function: ispresent().
LZ背景弱 对于没见过的题目无法直接想到方法。小哥给提示，说你先想2 by 2 array
。我就跟他说暴力方法。他说
对，you are on the right direction。在他的提示下我给了暴力做法。小哥不断给支
持和鼓励。最后时间不多了
代码写了个大概，小哥就让问问题了。
