-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay14.Java
46 lines (37 loc) · 1.06 KB
/
Day14.Java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
class Difference {
private int[] elements;
public int maximumDifference;
public Difference(int[] a){
this.elements = a;
}
public int computeDifference(){
int k = elements.length;
int tmpDif;
for (int i = 0; i < k; i++){
for (int j = i + 1; j < k; j++){
tmpDif = Math.abs(elements[i] - elements[j]);
if (tmpDif > maximumDifference) maximumDifference = tmpDif;
}
}
return maximumDifference;
}
} // End of Difference class
public class Solution {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = sc.nextInt();
}
sc.close();
Difference difference = new Difference(a);
difference.computeDifference();
System.out.print(difference.maximumDifference);
}
}