Solution to today's problem

Author: spannm

src/main/java/io/github/spannm/leetcode/lc1/lc1500/Problem1509.java

@@ -9,18 +9,18 @@
  */
 class Problem1509 extends LeetcodeProblem {
 
-    int minDifference(int[] nums) {
-        int n = nums.length;
-        if (n < 5) {
+    int minDifference(int[] _nums) {
+        int len = _nums.length;
+        if (len < 5) {
             return 0;
         }
-        Arrays.sort(nums);
-        long ans = 1L << 60;
+        Arrays.sort(_nums);
+        long result = 1L << 60;
         for (int l = 0; l <= 3; l++) {
             int r = 3 - l;
-            ans = Math.min(ans, (long) nums[n - 1 - r] - nums[l]);
+            result = Math.min(result, (long) _nums[len - 1 - r] - _nums[l]);
         }
-        return (int) ans;
+        return (int) result;
     }
 
 }