[LeetCode] 3Sum Closest

public class Solution {
public int threeSumClosest(int[] num, int target) {
List<Integer> sortedNum = new ArrayList<Integer>();
for (int i = 0; i < num.length; ++i) {
sortedNum.add(num[i]);
}
Collections.sort(sortedNum);

int closest = num[0] + num[1] + num[2];
int min = Math.abs(closest - target);
for (int i = 0; i < num.length - 2; ++i) {
int num1 = sortedNum.get(i);
for (int j = i + 1, k = (num.length - 1); j < k;) {
int temp = num1 + sortedNum.get(j) + sortedNum.get(k);
if (temp > target) {
--k;
} else {
++j;
}
if (Math.abs(temp - target) < min) {
min = Math.abs(temp - target);
closest = temp;
}
}
}

return closest;
}
}