Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package ListsMoreExercise;
- import java.util.*;
- import java.util.stream.Collectors;
- public class MixedUpLists {
- public static void main(String[] args) {
- Scanner scanner = new Scanner(System.in);
- List<Integer> list1 = Arrays.
- stream(scanner.nextLine().split("\\s+")).map(Integer::parseInt).collect(Collectors.toList());
- List<Integer> list2 = Arrays.
- stream(scanner.nextLine().split("\\s+")).map(Integer::parseInt).collect(Collectors.toList());
- List<Integer> list3 = new ArrayList<>();
- List<Integer> finalList = new ArrayList<>();
- int firstConstrain = 0;
- int secondConstrain = 0;
- if (list1.size() > list2.size()) {
- firstConstrain = list1.get(list1.size() - 2);
- secondConstrain = list1.get(list1.size() - 1);
- Collections.reverse(list2);
- for (int i = 0; i < list2.size(); i++) {
- list3.add(list1.get(i));
- list3.add(list2.get(i));
- }
- } else if (list1.size() < list2.size()) {
- firstConstrain = list2.get(list2.size() - 2);
- secondConstrain = list2.get(list2.size() - 1);
- Collections.reverse(list2);
- for (int i = 0; i < list1.size(); i++) {
- list3.add(list1.get(i));
- list3.add(list2.get(i+2));
- }
- }
- int smallerNumber = Math.min(firstConstrain, secondConstrain);
- int biggerNumber = Math.max(firstConstrain, secondConstrain);
- for (int i = 0; i < list3.size(); i++) {
- if (list3.get(i) > smallerNumber && list3.get(i) < biggerNumber) {
- finalList.add(list3.get(i));
- }
- }
- Collections.sort(finalList);
- finalList.forEach(e -> System.out.print(e + " "));
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement