Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.io.BufferedReader;
- import java.io.IOException;
- import java.io.InputStreamReader;
- class DLL<E> {
- private DLLNode<E> first, last;
- public DLL() {
- 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 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;
- 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;
- }
- }
- return null;
- }
- @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 DLLNode<E> getFirst() {
- return first;
- }
- public DLLNode<E> getLast() {
- return last;
- }
- }
- 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()+"->";
- }
- }
- public class DivideOddEven {
- public static DLL<Integer> getOdd(DLL<Integer> in)
- {
- DLL<Integer> neparnilista=new DLL<Integer> ();
- DLLNode<Integer> jazol=in.getFirst();
- while(jazol!=null)
- {
- if(jazol.element %2!=0)
- {
- neparnilista.insertLast(jazol.element);
- jazol=jazol.succ;
- }
- else
- jazol=jazol.succ;
- }
- return neparnilista;
- }
- public static DLL<Integer> getEven(DLL<Integer> in)
- {
- DLL<Integer> parnilista=new DLL<Integer> ();
- DLLNode<Integer> jazol=in.getFirst();
- while(jazol!=null)
- {
- if(jazol.element %2==0)
- {
- parnilista.insertLast(jazol.element);
- jazol=jazol.succ;
- }
- else
- jazol=jazol.succ;
- }
- return parnilista;
- }
- public static void main(String[] args) throws IOException {
- DLL<Integer> lista = new DLL<Integer>();
- BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
- String s = stdin.readLine();
- int N = Integer.parseInt(s);
- s = stdin.readLine();
- String[] pomniza = s.split(" ");
- for (int i = 0; i < N; i++) {
- lista.insertLast(Integer.parseInt(pomniza[i]));
- }
- DLL<Integer> neparni = getOdd(lista);
- DLL<Integer> parni = getEven(lista);
- DLLNode<Integer> tmp = neparni.getFirst();
- boolean entered = false;
- while (tmp != null) {
- System.out.print(tmp.element);
- if(tmp.succ!=null)
- System.out.print(" ");
- tmp = tmp.succ;
- entered = true;
- }
- if (entered == true) {
- System.out.println();
- }
- entered = false;
- tmp = parni.getFirst();
- while (tmp != null) {
- System.out.print(tmp.element);
- if(tmp.succ!=null)
- System.out.print(" ");
- tmp = tmp.succ;
- entered = true;
- }
- if (entered == true) {
- System.out.println();
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement