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> {
- 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;
- }
- public DLLNode() {
- this.element=null;
- this.pred=null;
- this.succ=null;
- }
- public DLLNode (DLLNode<E> o) {
- this.element=o.element;
- this.pred=o.pred;
- this.succ=o.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 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;
- }
- @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;
- }
- 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 class Duplikat {
- public static void main(String [] args)throws IOException{
- DLL<Integer> lista = new DLL<Integer>();
- BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
- String s = br.readLine();
- int n = Integer.parseInt(s);
- s=br.readLine();
- String [] niza = s.split(" ");
- for(int i=0;i<n;i++)
- lista.insertLast(Integer.parseInt(niza[i]));
- DLLNode<Integer> jazol = lista.getFirst();
- while(jazol.succ!=null){
- if(jazol.element.compareTo(jazol.succ.element)==0 && jazol.succ.succ!=null)
- jazol.succ=jazol.succ.succ;
- else if(jazol.element.compareTo(jazol.succ.element)==0 && jazol.succ.succ==null)
- jazol.succ=null;
- else
- jazol=jazol.succ;
- }
- jazol=lista.getFirst();
- while(jazol!=null){
- if(jazol.succ==null){
- System.out.print(jazol.element);
- break;
- }
- System.out.print(jazol.element+" ");
- jazol=jazol.succ;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement