windows 8 装好后那里看product key?# PDA - 掌中宝
h*3
1 楼
the book has one solution for many calls: composing one hashtable for 19,683
boards, each board might have value 0,1,2
return hashtableWinner[board].
I am a little confused about the idea. I am assuming one board might have 3
different results: unknown (it might be a tie, or any other result), 1 (blue
win), 2 (red win). Based on this assumption, each board can have one
specific value. That why we can return hashtableWinner[board].
Also, for the only one call methods, that means: the input is a specific
board, we just need check who is the winner.
Am I right?
boards, each board might have value 0,1,2
return hashtableWinner[board].
I am a little confused about the idea. I am assuming one board might have 3
different results: unknown (it might be a tie, or any other result), 1 (blue
win), 2 (red win). Based on this assumption, each board can have one
specific value. That why we can return hashtableWinner[board].
Also, for the only one call methods, that means: the input is a specific
board, we just need check who is the winner.
Am I right?
