3 sum closest

LeetCode/3Sum-Closest/Readme.MD

@@ -0,0 +1,3 @@
+Question
+
+Link - [3Sum Closest](https://leetcode.com/problems/3sum-closest/)

LeetCode/3Sum-Closest/question.txt

@@ -0,0 +1,21 @@
+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 input would have exactly one solution.
+
+Example 1:
+
+Input: nums = [-1,2,1,-4], target = 1
+Output: 2
+Explanation: The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
+Example 2:
+
+Input: nums = [0,0,0], target = 1
+Output: 0
+
+
+Constraints:
+3 <= nums.length <= 1000
+-1000 <= nums[i] <= 1000
+-104 <= target <= 104

LeetCode/3Sum-Closest/solution.cpp

@@ -0,0 +1,38 @@
+class Solution {
+public:
+    int threeSumClosest(vector<int>& nums, int target) {
+        sort(nums.begin(), nums.end());
+        vector<int> v;
+
+        long int closest = INT_MAX;
+        bool found = false;
+        for(int i=0; i<nums.size(); i++) {
+
+            int left = i + 1;
+            int right = nums.size() - 1;
+            long int imt = 0;
+            while(left < right) {
+                imt = nums[i] + nums[left] + nums[right];
+                // closest = std::min(abs(imt-target), abs(closest-target));
+                if(abs(imt-target) < abs(closest-target)) {
+                    closest = imt;
+                }
+                if(imt == target) {
+                    found = true;
+                    break;
+                }
+                if(imt < target) {
+                    left++;
+                }
+                else {
+                    right--;
+                }
+            }
+            if(found) {
+                break;
+            }
+        }
+
+        return closest;
+    }
+};