АПС Кол1 Листа ПарНепар 2019/20

package Kolokvium19ta;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

class DLLNode<E> {
    protected E element;
    protected DLLNode<E> pred, succ;

    public DLLNode(E elem, DLLNode<E> pred, DLLNode<E> succ) {
        this.element = elem;
        this.pred = pred;
        this.succ = succ;
    }

    @Override
    public String toString() {
        return element.toString();
    }
}

class DLL<E> {
    private DLLNode<E> first, last;

    public DLL() {
        // Construct an empty SLL
        this.first = null;
        this.last = null;
    }

    public void deleteList() {
        first = null;
        last = null;
    }

    public int length() {
        int ret;
        if (first != null) {
            DLLNode<E> tmp = first;
            ret = 1;
            while (tmp.succ != null) {
                tmp = tmp.succ;
                ret++;
            }
            return ret;
        } else
            return 0;

    }

    public DLLNode<E> find(E o) {
        if (first != null) {
            DLLNode<E> tmp = first;
            while (tmp.element != o && tmp.succ != null)
                tmp = tmp.succ;
            if (tmp.element == o) {
                return tmp;
            } else {
                System.out.println("Elementot ne postoi vo listata");
            }
        } else {
            System.out.println("Listata e prazna");
        }
        return first;
    }

    public void insertFirst(E o) {
        DLLNode<E> ins = new DLLNode<E>(o, null, first);
        if (first == null)
            last = ins;
        else
            first.pred = ins;
        first = ins;
    }

    public void insertLast(E o) {
        if (first == null)
            insertFirst(o);
        else {
            DLLNode<E> ins = new DLLNode<E>(o, last, null);
            last.succ = ins;
            last = ins;
        }
    }

    public void insertAfter(E o, DLLNode<E> after) {
        if (after == last) {
            insertLast(o);
            return;
        }
        DLLNode<E> ins = new DLLNode<E>(o, after, after.succ);
        after.succ.pred = ins;
        after.succ = ins;
    }

    public void insertBefore(E o, DLLNode<E> before) {
        if (before == first) {
            insertFirst(o);
            return;
        }
        DLLNode<E> ins = new DLLNode<E>(o, before.pred, before);
        before.pred.succ = ins;
        before.pred = ins;
    }

    public E deleteFirst() {
        if (first != null) {
            DLLNode<E> tmp = first;
            first = first.succ;
            if (first != null)
                first.pred = null;
            if (first == null)
                last = null;
            return tmp.element;
        } else
            return null;
    }

    public E deleteLast() {
        if (first != null) {
            if (first.succ == null)
                return deleteFirst();
            else {
                DLLNode<E> tmp = last;
                last = last.pred;
                last.succ = null;
                return tmp.element;
            }
        }
        // else throw Exception
        return null;
    }

    public E delete(DLLNode<E> node) {
        if (node == first) {
            deleteFirst();
            return node.element;
        }
        if (node == last) {
            deleteLast();
            return node.element;
        }
        node.pred.succ = node.succ;
        node.succ.pred = node.pred;
        return node.element;

    }

    @Override
    public String toString() {
        String ret = new String();
        if (first != null) {
            DLLNode<E> tmp = first;
            ret += tmp + "<->";
            while (tmp.succ != null) {
                tmp = tmp.succ;
                ret += tmp + "<->";
            }
        } else
            ret = "Prazna lista!!!";
        return ret;
    }

    public String toStringR() {
        String ret = new String();
        if (last != null) {
            DLLNode<E> tmp = last;
            ret += tmp + "<->";
            while (tmp.pred != null) {
                tmp = tmp.pred;
                ret += tmp + "<->";
            }
        } else
            ret = "Prazna lista!!!";
        return ret;
    }

    public DLLNode<E> getFirst() {
        return first;
    }

    public DLLNode<E> getLast() {

        return last;
    }

    /*
     * public void sortiraj_opagacki(DLL<Integer> lista) {
     *
     * int n = lista.length();
     *
     * for (int i = 0; i < n; i++) { DLLNode<Integer> temp = lista.getFirst();
     *
     * while (temp.succ != null) { if (temp.element < temp.succ.element) { int
     * tempData;
     *
     * tempData = temp.element; temp.element = temp.succ.element; temp.succ.element
     * = tempData;
     *
     * } temp = temp.succ; } } }
     */

}

public class ParNepar {

    public static void podeliParnost(DLL<Integer> neparni, DLL<Integer> parni, DLL<Integer> finalna1) {
        DLLNode<Integer> head = neparni.getFirst();
        DLLNode<Integer> head2 = parni.getFirst();

        DLLNode<Integer> temp = neparni.getFirst();

        while (temp != null) {

            if (head.element % 2 != 0) {
                finalna1.insertLast(head.element);
            }

            if (head2.element % 2 == 0) {
                finalna1.insertLast(head2.element);
            }

            head = head.succ;
            head2 = head2.succ;

            temp = temp.succ;
        }

    }

    public static void sortiraj(DLL<Integer> finalna) {
        DLLNode<Integer> momentalen = finalna.getFirst();

            while (momentalen != null) {

                DLLNode<Integer> sleden = momentalen.succ;

                if (momentalen.succ != null) {
                    sleden = momentalen.succ;
                }

                while (sleden != null) {

                    if (sleden.element > momentalen.element) {

                        finalna.insertBefore(sleden.element, momentalen);
                        finalna.delete(sleden);

                    }

                    sleden = sleden.succ;
                }

                momentalen = momentalen.succ;
            }
    }


    public static void main(String[] args) throws IOException {
        DLL<Integer> lista1 = new DLL<Integer>(), lista2 = new DLL<Integer>(), finalna = new DLL<Integer>();

        BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
        // vnesvenje na dolzinite na listata
        String s = stdin.readLine();
        String[] pomniza = s.split(" ");
        int n = Integer.parseInt(pomniza[0]);
        int m = Integer.parseInt(pomniza[1]);

        // polnenje na lista1
        s = stdin.readLine();
        String[] niza = s.split(" ");
        for (int i = 0; i < n; i++) {
            lista1.insertLast(Integer.parseInt(niza[i]));
        }

        // polnenje na lista2
        s = stdin.readLine();
        niza = s.split(" ");
        for (int i = 0; i < m; i++) {
            lista2.insertLast(Integer.parseInt(niza[i]));
        }

        podeliParnost(lista1, lista2, finalna);

        // finalna.sortiraj_opagacki(finalna);

        for (int i = 0; i < finalna.length(); i++) {
            sortiraj(finalna);
        }

        DLLNode<Integer> temp = finalna.getFirst();
        if (temp != null) {

            while (temp != null) {
                System.out.println(temp.element);

                temp = temp.succ;
            }
        } else {

            System.out.println("Prazna lista");

        }
    }
}