139. Largest Value in the List
Foundation1000 ms256 MBSolved by 0%
Build the list and print its largest value.
Print Empty for an empty list.
Constraints - `0 ≤ n ≤ 100000` - `-1000000 ≤ value ≤ 1000000`
Input
The first line contains an integer n, the number of nodes.
The second line contains n space-separated integers, the node values from head to tail.
The starter code builds the list for you; work on the nodes, not the array.
Output
Print one integer, the largest node value, or Empty for an empty list.
Input5
3 9 2 9 4
Output9
Notehas the maximum appearing twice
Input3
-8 -2 -15
Output-2
Noteis entirely negative, so a running best starting at zero is wrong
Hints
Four rungs, in order. The last two open once you have submitted an attempt. A wrong one counts.
Hint 1Where to start
Hint 2The approachOpen hint 1 first. This one carries on from it.
Hint 3PseudocodeOpen hint 2 first. This one carries on from it.
Hint 4Full solutionOpen hint 3 first. This one carries on from it.