package Listi;

import java.util.Scanner;

public class Listi {


    public static void pecati(Array<Double> niza)
    {
        for(int i=0; i<niza.getLength()-1; i++)
        {
            System.out.print(niza.get(i)+" ");
        }
        System.out.print(niza.get(niza.getLength()-1));
    }

    public static void pecati(SLL<Double> list)
    {
        SLLNode<Double> tmp = list.getFirst();

        while(tmp.succ != null)
        {
            System.out.print(tmp.element + " ");
            tmp = tmp.succ;
        }
        System.out.print(tmp.element);
    }

    public static double maxElement(SLL<Double> list)
    {
        SLLNode<Double> tmp = list.getFirst();
        double maxi = list.getFirst().element;

        while(tmp != null)
        {
            if(tmp.element.compareTo(maxi)==1)
            {
                maxi = tmp.element;
            }
            tmp = tmp.succ;
        }
        return maxi;
    }

    public static double aritmeticka(SLL<Double> list)
    {
        SLLNode<Double> tmp = list.getFirst();
        double sum=0;

        while(tmp != null)
        {
            sum+=tmp.element;
            tmp = tmp.succ;
        }
        int k = list.length();
        double prosek = (double)sum/k;
        return prosek;
    }

    public static SLL<Double> duplikati(SLL<Double> list)
    {
        SLLNode<Double> i = list.getFirst();
        SLLNode<Double> j = i.succ;

        while(i != null)
        {
            j = i.succ;
            while(j != null)
            {
                if(i.element.equals(j.element))
                {
                    SLLNode<Double> tmp = j;
                    list.delete(tmp);
                }
                j = j.succ;
            }
            i = i.succ;
        }

        return list;
    }


    public static SLL<Double> sort(SLL<Double> list)
    {
        SLLNode<Double> i = list.getFirst();
        SLLNode<Double> j = i.succ;

        while(i != null)
        {
            j = i.succ;
            while(j != null)
            {
                if(i.element.compareTo(j.element)==1)
                {
                    double tmp = i.element;
                    i.element = j.element;
                    j.element = tmp;
                }
            }
        }
        return list;
    }

    public static SLL<Double> transform (Array<Double> niza)
    {
        SLL<Double> list = new SLL<Double>();
        for(int i=0; i<niza.getLength(); i++)
        {
            list.insertLast(niza.get(i));
        }
        return list;
    }
     //transformiranje od lista vo niza
    public static Array<Double> transform (SLL<Double> list)
    {
        Array<Double> niza = new Array<Double>(list.length());

        SLLNode<Double> tmp = list.getFirst();

        int i=0;
        while(tmp != null)
        {
            niza.set(i, tmp.element);
            tmp = tmp.succ;
            i++;
        }
        return niza;
    }


    public static void main (String [] args)
    {
        SLL<Double> list = new SLL<Double>();
        Scanner s = new Scanner(System.in);


        int n;
        n = s.nextInt();

        Array<Double> niza;
        niza = new Array<Double>(n);
        System.out.println("Vnesi niza: ");
        for(int i=0; i<n; i++)
        {
            niza.set(i, s.nextDouble());
        }
        System.out.println("Vnesi lista: ");
        for(int i=0; i<n; i++)
        {
            list.insertLast(s.nextDouble());
        }

        System.out.println("Od lista vo niza: ");
        Array<Double> transNiza = transform(list); //kreiram niza i so povik na funk. transform ja transformiram od lista vo niza
        pecati(niza);
        System.out.println("\nOd niza vo lista: ");
        SLL<Double> transLista = transform(niza);
        pecati(list);
        System.out.println("\nMax element: " + maxElement(list));
        System.out.println("\nAritmetichka sredina: " + aritmeticka(list));
        System.out.println("\nBrishenje duplikati: " + duplikati(list));
    }

}