3Sum Closest

//Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. 
//Return the sum of the three integers. You may assume that each input would have exactly one solution.
//Brute forced it
class Solution {
    public int threeSumClosest(int[] nums, int target) {
        int closestSum = nums[0] + nums[1] + nums[2];
        System.out.println(closestSum);
        
        for(int i = 0; i < nums.length - 2; i++)
        {
            for(int j = i + 1; j < nums.length - 1; j++)
            {
                for(int k = j + 1; k < nums.length; k++)
                {
                    if(Math.abs(nums[i] + nums[j] + nums[k] - target) < Math.abs(closestSum - target))
                    {
                        closestSum = nums[i] + nums[j] + nums[k];
                        System.out.println(nums [i] + " " + nums[j] + " " + nums[k]);
                    }
                }
            }
        }
        return closestSum;
    }
}