330. Min Element in Linked List

Given the head of a singly linked list, return the minimum value among all node values.

Input: Head of a singly linked list (at least one node).

Output: Integer — minimum node value.

Examples

Input: [3,1,4,1,5,9,2,6]
Output: 1
Explanation: Traverse all; min is 1.

Input: [-5,-1,-3]
Output: -5
Explanation: All negatives; min is -5.

Input: [7]
Output: 7
Explanation: Single node; min is 7.

Constraints

• 1<=nodes<=10^5
• -10^9<=Node.val<=10^9

Asked by