[N-0] refactor 16

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_16.java

@@ -15,9 +15,6 @@ public class _16 {
 
     public static class Solution1 {
         public int threeSumClosest(int[] nums, int target) {
-            if (nums == null || nums.length == 0) {
-                return 0;
-            }
             Arrays.sort(nums);
             int len = nums.length;
             if (len < 3) {
@@ -28,9 +25,9 @@ public int threeSumClosest(int[] nums, int target) {
                 return sum;
             }
             int sum = nums[0] + nums[1] + nums[2];
-            for (int i = 0; i < nums.length - 2; i++) {
+            for (int i = 0; i < len - 2; i++) {
                 int left = i + 1;
-                int right = nums.length - 1;
+                int right = len - 1;
                 while (left < right) {
                     int thisSum = nums[i] + nums[left] + nums[right];
                     if (Math.abs(target - thisSum) < Math.abs(target - sum)) {