877. Stone Game——dp

题目分析：dp[i][j]为i到j  Alex赢lee的个数

class Solution(object):
    def stoneGame(self, piles):
        """
        :type piles: List[int]
        :rtype: bool
        """
        length = len(piles)
        dp = [[0 for i in range(length)] for j in range(length)]
        # dp = [[0]*length]*length
        for i in range(len(piles)):
            dp[i][i] = piles[i]
        for j in range(1, length):    
            for k in range(length-j):
                dp[k][k+j] = max(piles[k] - dp[k+1][k+j], piles[k+j]-dp[k][k+j-1])
        return dp[0][length-1] > 0