update 1099

fishercoder1534 · fishercoder1534 · commit f1b056257ce2 · 2024-01-27T11:53:32.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_1099.java b/src/main/java/com/fishercoder/solutions/_1099.java
@@ -8,12 +8,12 @@ public static class Solution1 {
          * Time: O(n^2)
          * Space: O(1)
          */
-        public int twoSumLessThanK(int[] A, int K) {
+        public int twoSumLessThanK(int[] nums, int k) {
             int maxSum = Integer.MIN_VALUE;
-            for (int i = 0; i < A.length - 1; i++) {
-                for (int j = i + 1; j < A.length; j++) {
-                    if (A[i] + A[j] < K) {
-                        maxSum = Math.max(maxSum, A[i] + A[j]);
+            for (int i = 0; i < nums.length - 1; i++) {
+                for (int j = i + 1; j < nums.length; j++) {
+                    if (nums[i] + nums[j] < k) {
+                        maxSum = Math.max(maxSum, nums[i] + nums[j]);
                     }
                 }
             }
@@ -26,16 +26,16 @@ public static class Solution2 {
          * Time: O(nlogn)
          * Space: O(1)
          */
-        public int twoSumLessThanK(int[] A, int K) {
-            Arrays.sort(A);
+        public int twoSumLessThanK(int[] nums, int k) {
+            Arrays.sort(nums);
             int left = 0;
-            int right = A.length - 1;
+            int right = nums.length - 1;
             int sum = Integer.MIN_VALUE;
             while (left < right) {
-                int newSum = A[left] + A[right];
-                if (newSum < K && newSum > sum) {
+                int newSum = nums[left] + nums[right];
+                if (newSum < k && newSum > sum) {
                     sum = newSum;
-                } else if (newSum >= K) {
+                } else if (newSum >= k) {
                     right--;
                 } else {
                     left++;
