-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay14_Scope.java
executable file
·57 lines (44 loc) · 1.15 KB
/
Day14_Scope.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
47
48
49
50
51
52
53
54
55
56
57
/*
* Sapayth Hossain
*/
package ThirtyDaysOfCode;
import java.util.Scanner;
/*
* @author sapaythhossain
*/
public class Day14_Scope {
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);
}
}
class Difference {
private int[] elements;
public int maximumDifference;
// Add your code here
public Difference(int[] a) {
elements = new int[a.length];
System.arraycopy(a, 0, elements, 0, a.length);
}
public void computeDifference() {
int high = elements[0];
int low = elements[0];
for (int i = 0; i < elements.length; i++) {
if (elements[i] > high) {
high = elements[i];
}
if (elements[i] < low) {
low = elements[i];
}
}
maximumDifference = high - low;
}
}