LC-16 Python accepted

Author: davidyslu

LC-16/LC-16.cpp

@@ -16,7 +16,7 @@ class Solution {
         int n = nums.size();
         sort(nums.begin(), nums.end());
 
-        for (int i = 0; i < n; ++i) {
+        for (int i = 0; i < n - 2; ++i) {
             int left = i + 1, right = n - 1;
             while (left < right) {
                 int sum = nums[i] + nums[left] + nums[right];

LC-16/LC-16.py

@@ -0,0 +1,30 @@
+class Solution:
+    '''
+    Concepts: Two Pointers
+    1. Sort the input array nums
+    2. Make two pointers left and right at i + 1 and n - 1 respectively
+    3. Check the sum of of nums[i] + nums[left] + nums[right] which is closest to the target
+    '''
+    def threeSumClosest(self, nums: List[int], target: int) -> int:
+        nums.sort()
+
+        nLen = len(nums)
+        result = nums[0] + nums[1] + nums[nLen - 1]
+        for i in range(nLen - 2):
+            left = i + 1
+            right = nLen - 1
+            
+            while left < right:
+                sums =  nums[i] + nums[left] + nums[right]
+                if sums == target:
+                    return sums
+                
+                if abs(sums - target) < abs(result - target):
+                    result = sums
+                
+                if sums > target:
+                    right -= 1
+                else:
+                    left += 1
+
+        return result