linked lists problems

[b8asj9]

hi,

i need to find the highest int value in a linked list of integer objects. i've extracted primitive int values using an iterator and .intValue but im unsure on how to find the max int value in the list. do i need to use Integer.MAX_VALUE?

any help is appreciated.
thanks

[r035198x]

hi,

i need to find the highest int value in a linked list of integer objects. i've extracted primitive int values using an iterator and .intValue but im unsure on how to find the max int value in the list. do i need to use Integer.MAX_VALUE?

any help is appreciated.
thanks

Let's see the code that you've done

[b8asj9]

    int i = Integer.MAX_VALUE;
 
    ListIterator iter= l.listIterator();
    while (iter.hasNext()) {
        int i = ((Integer)iter.next()).intValue();
        if (i < 0) {
        lrgIdx = i;
    }
    return lrgIdx;
    }
 

sorry if the logic is not correct, but this is my first attempt.

[r035198x]

    int i = Integer.MAX_VALUE;
 
    ListIterator iter= l.listIterator();
    while (iter.hasNext()) {
     int i = ((Integer)iter.next()).intValue();
     if (i < 0) {
        lrgIdx = i;
    }
    return lrgIdx;
}
 

sorry if the logic is not correct, but this is my first attempt.

To find the largest element in a list, You must first assign the first element to be the largest. Then move through each of the elements comparing with the currently largest element. If current element is bigger than the currently largest element, then you make current element the largest element and move on to the next element until you've gone through all the elements.