source: https://www.hackerrank.com/challenges/30-scope
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
class Difference {
private int[] elements;
public int maximumDifference;
Difference(int[] elements) {
this.elements = elements;
}
public void computeDifference() {
this.maximumDifference = Arrays.stream(this.elements).max().getAsInt() - Arrays.stream(this.elements).min().getAsInt();
}
} // 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);
}
}
本文介绍了一个名为Difference的类,该类用于计算整数数组中最大与最小元素之间的差值。通过构造函数初始化数组,并使用computeDifference方法计算最大差值。
178

被折叠的 条评论
为什么被折叠?



