findHighest.cpp

findHighest.cpp

Go Back

// Link to challenge: https://edabit.com/challenge/LNtD7xK33ncfEYDYv

#include <iostream>
#include <vector>

class Highest{
    private:

        struct node{
            int data;
            node* next;
        };

        node* head = nullptr;

    public:
        Highest();

        Highest(std::vector<int> arr){
            for (int i = 0; i < arr.size(); i++){
                if (head == nullptr){
                    head = new node{arr[i], nullptr};
                }
                else{
                    head = new node{arr[i], head};
                }
            }
        }

        int findHighest(){
            int biggest = 0;
            for (node* i = head; i != nullptr; i = i -> next){
                if (i -> data > biggest){
                    biggest = i -> data;
                }
            }
            return biggest;
        }

        void printArr(std::vector<int> arr){
            for (int i = 0; i < arr.size(); i++){
                std::cout << arr[i] << " ";
            }
        }

        void printResult(){
            std::cout << findHighest() << std::endl;
        }
};

int main(){
    Highest v1({-1, 3, 5, 6, 99, 12, 2});
    v1.printResult();
    Highest v2({0, 12, 4, 87});
    v2.printResult();
    Highest v3({6, 7, 8});
    v3.printResult();
    return 0;
}

Console Output

99
87
8

Go Back