Update Solution.java

Author: javadev

src/main/java/g1001_1100/s1027_longest_arithmetic_subsequence/Solution.java

@@ -15,7 +15,6 @@ public int longestArithSeqLength(int[] nums) {
         for (int[] d : dp) {
             Arrays.fill(d, 1);
         }
-
         int ans = 0;
         for (int i = 0; i < n; i++) {
             for (int j = i - 1; j >= 0; j--) {
@@ -27,29 +26,26 @@ public int longestArithSeqLength(int[] nums) {
                 }
             }
         }
-
         return ans;
     }
 
-    public int maxElement(int[] arr) {
+    private int maxElement(int[] arr) {
         int max = Integer.MIN_VALUE;
         for (Integer e : arr) {
             if (max < e) {
                 max = e;
             }
         }
-
         return max;
     }
 
-    public int minElement(int[] arr) {
+    private int minElement(int[] arr) {
         int min = Integer.MAX_VALUE;
         for (Integer e : arr) {
             if (min > e) {
                 min = e;
             }
         }
-
         return min;
     }
 }