382. Count and Sum of Nodes
EasyTraversal
Print the number of nodes and the sum of their values.
Input format
Line 1: n (number of level-order entries) Line 2: the values in level order, -1 for a missing child
Output format
count sum
Example 1
Input
7 3 9 20 -1 -1 15 7
Output
5 54
Example 2
Input
1 -5
Output
1 -5
Constraints
1 ≤ nodes ≤ 10⁴
Read input from standard input and print the answer to standard output. Your code is judged against 5 test cases, most of them hidden.
Loading the MyLoginn IDE…