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 DLLNode<E extends Number> {
- 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 extends Number> {
- private DLLNode<E> first, last;
- public DLL() {
- this.first = null;
- this.last = null;
- }
- @Override
- public String toString() {
- if (first != null) {
- DLLNode<E> temp = first;
- StringBuffer sb = new StringBuffer();
- sb.append(temp.toString() + " ");
- while (temp.succ != null) {
- temp = temp.succ;
- sb.append(temp + " ");
- }
- sb.setLength(sb.length() - 1);
- return sb.toString();
- } else {
- return "";
- }
- }
- 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 E deleteFirst() {
- if (first != null) {
- DLLNode<E> tmp = first;
- first = first.succ;
- first.pred = null;
- if (first == null)
- last = null;
- return tmp.element;
- }
- 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;
- }
- 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 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;
- }
- public void split(DLL<Integer> original, DLL<Integer> odds, DLL<Integer> evens) {
- while (original.first != null) {
- if (original.first.element % 2 == 0) {
- evens.insertLast(original.first.element);
- } else {
- odds.insertLast(original.first.element);
- }
- first = first.succ;
- }
- }
- }
- class DivideOddEven {
- public static void main(String[] args) throws IOException {
- BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
- String s = stdin.readLine();
- int N = Integer.parseInt(s);
- s = stdin.readLine();
- String[] pomniza = s.split(" ");
- DLL<Integer> list = new DLL<Integer>();
- for (int i = 0; i < N; i++) {
- list.insertLast(Integer.parseInt(pomniza[i]));
- }
- // System.out.println(list.toString());
- DLL<Integer> odds = new DLL<Integer>();
- DLL<Integer> evens = new DLL<Integer>();
- list.split(list, odds, evens);
- System.out.println(odds.toString());
- System.out.println(evens.toString());
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement