Update README.md

Author: yanglbme

solution/0000-0099/0016.3Sum Closest/README.md

@@ -317,30 +317,33 @@ class Solution {
 
 #### C
 
-```C
-int cmp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
-
-int threeSumClosest(int *nums, int numsSize, int target) {
-  qsort(nums, numsSize, sizeof(int), cmp);
-  int closest = nums[0] + nums[1] + nums[2];
-
-  for (int i = 0; i < numsSize - 2; i++) {
-    int j = i + 1, k = numsSize - 1;
-    while (j < k) {
-      int sum = nums[i] + nums[j] + nums[k];
-      if (abs(sum - target) < abs(closest - target)) {
-        closest = sum;
-      }
-      if (sum < target)
-        j++;
-      else
-        k--;
-    }
-  }
-
-  return closest;
+```c
+int cmp(const void* a, const void* b) {
+    return (*(int*) a - *(int*) b);
 }
 
+int threeSumClosest(int* nums, int numsSize, int target) {
+    qsort(nums, numsSize, sizeof(int), cmp);
+    int ans = 1 << 30;
+    for (int i = 0; i < numsSize; ++i) {
+        int j = i + 1, k = numsSize - 1;
+        while (j < k) {
+            int t = nums[i] + nums[j] + nums[k];
+            if (t == target) {
+                return t;
+            }
+            if (abs(t - target) < abs(ans - target)) {
+                ans = t;
+            }
+            if (t > target) {
+                --k;
+            } else {
+                ++j;
+            }
+        }
+    }
+    return ans;
+}
 ```
 
 <!-- tabs:end -->