Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public int solution(int[] A) {
- long rsum = 0;
- for (int i = 1; i < A.length; i++)
- rsum += A[i];
- long lsum = A[0];
- int min = (int) Math.abs(lsum - rsum);
- for (int i = 1; i < A.length-1; i++) {
- lsum += A[i];
- rsum -= A[i];
- int diff = (int) Math.abs(lsum - rsum);
- if (diff < min)
- min = diff;
- }
- return min;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement