leet888. fair candy swap

class Solution {
    public int[] fairCandySwap(int[] A, int[] B) {
        int alen = A.length;
        int blen = B.length;
        Long bsum  = 0L;
                Long asum  = 0L;
        for(int i=0;i<alen;i++){
            asum = asum + A[i];
        }
        for(int i=0;i<blen;i++){
            bsum = bsum + B[i];
        }
      
        int[] result = new int[2];
        Set<Integer> values = new HashSet<Integer>();
        int x = Math.abs(((Long)(bsum - asum)).intValue())/2;
        for(int i=0;i<alen;i++){
            values.add(A[i]);
        }
        
        if (asum>bsum){
             for(int i=0;i<blen;i++){
                 if (values.contains(B[i]+x)){
                     result[0] = B[i]+x;
                     result[1] = B[i];
                     return result;
                 }
             }
        }
        
        for(int i=0;i<blen;i++){
                 System.out.println(B[i]-x);
                 if (values.contains(B[i]-x)){
                     result[0] = B[i]-x;
                     result[1] = B[i];
                     return result;
                 }
                 
        }
         return result;
    }
}