SAA VII. Zadacha 3

/*
    Задача VII.3:
    Да се разработи функция, която намира максималния елемент на линеен
    едносвързан списък от цели числа.
*/

#include <iostream>
#include <bits/stdc++.h>

struct Node
{
    int data;
    struct Node* next;
} *first = NULL, *last = NULL;
using namespace std;

void addNumbers(int x)
{
    if(first == NULL)
    {
        first = new  Node;
        first->data = x;
        first->next = NULL;
        last = first;
    }
    else
    {
        Node *t = new Node;
        t->data = x;
        t->next = NULL;
        last->next = t;
        last = t;
    }
}

void displayList(struct Node *p)
{
    while(p)
    {
        cout << p->data << " ";
        p = p->next;
    }
}
void countNumber(struct Node *p)
{
    int numberOfElements = 0;
    while(p)
    {
        p = p->next;
        numberOfElements++;
    }
    cout << "The number of elements in the list is: " << numberOfElements << endl;
}

void countSpecificNumbers(struct Node *p, int specifiedNumber)
{
    int numberOfElements = 0;
    while(p)
    {
       if(p->data == specifiedNumber)
            numberOfElements++;
        p = p->next;

    }
    cout << "The number of elements with value "<< specifiedNumber << " in the list is: " << numberOfElements << endl;
}

int findMaxList(struct Node*p)
{
    int maxNumber = INT_MIN;
    while(p)
    {
       if(p->data > maxNumber)
            maxNumber = p->data;
        p = p->next;

    }
    cout << "The maximum number is "; // << maxNumber << endl;
    return maxNumber;
}


int main()
{
    addNumbers(1);
    addNumbers(2);
    addNumbers(2);
    addNumbers(4);
    displayList(first);
    cout << findMaxList(first) << endl;

}