public class Solution {
public int duplicate (int[] numbers) {
HashSet<Integer> set = new HashSet<>();
for (int i = 0; i < numbers.length; i++) {
if (set.contains(numbers[i])) {
return numbers[i];
}else {
set.add(numbers[i]);
}
}
return -1;
}
}
import java.util.*;
import java.util.stream.Collectors;
public class Solution {
public ArrayList<Integer> GetLeastNumbers_Solution(int[] input, int k) {
return (ArrayList<Integer>) Arrays.stream(input).sorted().limit(k).boxed().collect(Collectors.toList());
}
}
import java.util.*;
import java.math.BigDecimal;
public class Solution {
private ArrayList<Integer> list = new ArrayList<Integer>();
public void Insert(Integer num) {
list.add(num);
}
public Double GetMedian() {
Collections.sort(list);
if (list.size() % 2 == 1) {
return Double.valueOf(list.get(list.size() / 2));
}
BigDecimal dc1 = new BigDecimal(list.get(list.size() / 2 - 1));
BigDecimal dc2 = new BigDecimal(list.get(list.size() / 2));
BigDecimal divide = dc1.add(dc2).divide(new BigDecimal(2));
return divide.doubleValue();
}
}