LEETCODE QUESTION DOUBT

#	User	Rating
1	tourist	3985
2	jiangly	3741
3	jqdai0815	3682
4	Benq	3529
5	orzdevinwang	3526
6	ksun48	3489
7	Radewoosh	3483
8	Kevin114514	3442
9	ecnerwala	3392
9	Um_nik	3392

#	User	Contrib.
1	cry	169
2	atcoder_official	162
2	maomao90	162
2	Um_nik	162
5	djm03178	158
6	-is-this-fft-	157
7	adamant	155
8	awoo	154
8	Dominater069	154
10	nor	150

https://leetcode.com/problems/predict-the-winner/↵
Please check this question out on leetcode and can anyone tell me why my code wont work?↵
↵
~~~~~↵
class Solution {↵
    public boolean stoneGame(int[] piles) {↵
        int total=0;↵
        for(int pile:piles)total+=pile;↵
        int [][]dp=new int[piles.length][piles.length];↵
        for(int []arr:dp)Arrays.fill(arr,-1);↵
        int alice=recursion(0,piles.length-1,piles,true,dp);↵
        int bob=total-alice;↵
        return alice>=0bob;↵
    }↵
    public int recursion(int start,int end,int []piles,boolean alice,int [][]dp){↵
        if(start>end){↵
            return 0;↵
        }↵
        if(dp[start][end]!=-1)return dp[start][end];↵
        if(alice){↵
            int stTake=piles[start]+recursion(start+1,end,piles,false,dp);↵
            int endTake=piles[end]+recursion(start,end-1,piles,false,dp);↵
            return dp[start][end]=Math.max(stTake,endTake);↵
        }↵
        else{↵
            int stTake=-piles[start]+recursion(start+1,end,piles,true,dp);↵
            int endTake=-piles[end]+recursion(start,end-1,piles,true,dp);↵
            return dp[start][end]=Math.min(stTake,endTake);↵
        }↵
    }↵
}↵
~~~~~↵
↵