3Sum Closest

LeetCode / Two Pointer / 16번 / 3Sum Closese / JS

3Sum Closest - LeetCode Can you solve this real interview question? 3Sum Closest - Given an integer array nums of length n 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 inp leetcode.com 주어진 nums 배열에서 3개의 수를 뽑아서 더했을 때, target 값과 가장 가까운 값을 반환하면 된다. /** * @param {numbe..