Untitled
unknown
java
2 months ago
1.4 kB
2
Indexable
Never
public boolean helper(int[] arr, int leftIndex, int rightIndex, int turn, int p1, int p2){ if(arr.length % 2 == 0){ if(leftIndex == rightIndex){ System.out.println(p1 + " " + p2); return p1 > p2; } else{ if(turn == 0){ return helper(arr, leftIndex+1, rightIndex, 1, p1 + arr[leftIndex], p2) && helper(arr, leftIndex, rightIndex-1, 1, p1+arr[rightIndex],p2); } else{ return helper(arr, leftIndex+1, rightIndex, 0, p1, p2+arr[leftIndex]) || helper(arr, leftIndex, rightIndex-1, 0, p1,p2+arr[rightIndex]); } } } else{ if(leftIndex == rightIndex){ System.out.println(p1 + " " + p2); return p1 > p2; } else{ if(turn == 0){ return helper(arr, leftIndex+1, rightIndex, 1, p1 + arr[leftIndex], p2) && helper(arr, leftIndex, rightIndex-1, 1, p1+arr[rightIndex],p2); } else{ return helper(arr, leftIndex+1, rightIndex, 0, p1, p2+arr[leftIndex]) || helper(arr, leftIndex, rightIndex-1, 0, p1,p2+arr[rightIndex]); } } } } public boolean driver(int[] arr){