#724 · #877 · Stone Game(石子游戏)

There is a row of piles with an even number of piles. Alice and Bob alternately take a whole pile from either end, each maximising their own total. Return true if Alice wins; the total is odd, so there is always a winner. Constraints: 2 <= piles.length <= 500, piles.length is even, 1 <= piles[i] <= 500, and sum(piles) is odd.