My first attempt is to write a brutal DFS, which accepted. However, I found if I change it to a clearly wrong solution, it still can be accepted. But I failed to come up with a test case to catch it. Can anyone help me make one? Wrong one in comment

```
class Solution {
public:
bool PredictTheWinner(vector<int>& nums) {
int res=DFS(nums,0,nums.size()-1,true);
int sum=0;
for(int it:nums)
sum+=it;
return res>=sum-res?true:false;
}
int DFS(vector<int>& nums, int left, int right, bool first) {
if(left==right)
return first?nums[left]:0;
//return nums[left];
else
if(first)
return max(nums[left]+DFS(nums,left+1,right,!first), nums[right]+DFS(nums,left,right-1,!first));
else
return min(DFS(nums,left+1,right,!first), DFS(nums,left,right-1,!first));
}
};
```