Doubly LinkedList (based Iterator) 실습문제

 

- 코드 

#include <iostream>
#include <cmath>
using namespace std;

class Node {
public:
    int data;
    Node* next;
    Node* prev;
    
    Node() {
        this->next = NULL;
        this->prev = NULL;
    }
};

class Iterator {
public:
    Node* v;
    
    Iterator(Node* u) {
        this->v = u;
    }
    
    Iterator &operator++() {
        v = v->next;
        return *this;
    }
    
    Iterator &operator--() {
        v = v->prev;
        return *this;
    }
    
    int &operator*() {
        return v->data;
    }
    
    bool operator==(const Iterator &p) const {
        return this->v == p.v;
    }
    
    bool operator!=(const Iterator &p) const {
        return this->v != p.v;
    }
    
    friend class DoublyLinkedList;
};

class DoublyLinkedList {
public:
    int n;
    Node* header;
    Node* trailer;
    
    DoublyLinkedList() {
        this->n = 0;
        this->header = new Node();
        this->trailer = new Node();
        header->next = trailer;
        trailer->prev = header;
    }
    
    Iterator begin() {
        return Iterator(header->next);
    }
    
    Iterator end() {
        return Iterator(trailer);
    }
    
    void insert(const Iterator &p, const int d) {
        Node* w = p.v;
        Node* u = w->prev;
        Node* v = new Node();
        v->data = d;
        
        v->next = w;
        w->prev = v;
        v->prev = u;
        u->next = v;
        this->n++;
    }
    
    void insertBack(const int d) {
        insert(end(),d);
    }
    
    void calculate() {
        Iterator p = begin();
        double sum = 0;
        int max = p.v->data;
        int temp;
        while(p != end()) {
            temp = p.v->data;
            sum += temp;
            if(temp > max) {
                max = temp;
            }
            ++p;
        }
        sum /= n;
        int result = floor(sum);
        cout<<result<<" "<<max<<"\n";
    }
};

int main()
{
    int T;
    cin>>T;
    while(T--) {
        DoublyLinkedList list = DoublyLinkedList();
        int N;
        cin>>N;
        while(N--) {
            int d;
            cin>>d;
            list.insertBack(d);
        }
        list.calculate();
    }
}