-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathReverseAndExclude.java
More file actions
53 lines (41 loc) · 1.5 KB
/
ReverseAndExclude.java
File metadata and controls
53 lines (41 loc) · 1.5 KB
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
package ReverseAndExclude;
import java.util.*;
import java.util.function.Consumer;
import java.util.function.Function;
import java.util.function.Predicate;
import java.util.function.Supplier;
public class ReverseAndExclude {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
Integer[] nums = Arrays.stream(scanner.nextLine().split("\\s+"))
.mapToInt(Integer::parseInt)
.boxed()
.toArray(Integer[]::new);
int divisableNum = Integer.parseInt(scanner.nextLine());
Function<Integer[], Integer[]> reverseArr = arr -> {
for (int i = 0; i < arr.length / 2; i++) {
int temp = arr[i];
arr[i] = arr[arr.length - i - 1];
arr[arr.length - i - 1] = temp;
}
return arr;
};
nums = reverseArr.apply(nums);
Predicate<Integer> isDivisible = i -> i % divisableNum == 0;
for (Integer i:nums){
if(isDivisible.test(i)){
nums = removeElements(nums,i);
}
}
for (int i = 0; i < nums.length; i++) {
System.out.printf("%d ",nums[i]);
}
}
public static Integer[] removeElements(Integer[] input, Integer deleteMe) {
List<Integer> result = new LinkedList();
for(Integer item : input)
if(!deleteMe.equals(item))
result.add(item);
return result.toArray(new Integer[result.size()]);
}
}