Java - Lookup table, array, switch vs if considering computational time
<p>Let's consider a game such as rock, scissor, paper. In this case I can draw a binary map with the winning solution and store the map and create a look up table, however I think there are multiple strategies on how to do it:</p>

<ul>
<li>A series of if statements</li>
<li>An array and check if the solution is in the array</li>
<li>A switch statement</li>
</ul>

<p>What is the best way to create a look up table for such a problem?
For best way I mean the most computational and memory efficient way, many thanks</p>
