3 Sum

public class Solution {
    public int threeSumClosest(int[] arr, int b) {
        Arrays.sort(arr);
        int mindiff = Integer.MAX_VALUE;
        int close_sum = 0;
        for(int i=0;i<arr.length;i++){
            int v = arr[i];
            int j=i+1;
            int k=arr.length-1;
            while(j<k){
                long sum = arr[j]+arr[k]+v;
                int diff = (int)Math.abs(b-sum);
                if(diff<mindiff){
                    mindiff = diff;
                    close_sum = (int)sum;
                }
                if(sum < b){
                    j++;
                }else if(sum>b){
                    k--;
                }else{
                    return close_sum;
                }
            }
        }
        return close_sum;
    }
}