Questões Java para o Exterior

Work remotely with Turing to advance AIdevelopers.turing.com

Can you solve this?

int find_max(int nums[], int len)
{
    int i, max_num = nums[0];
    for (i = 1; i < len; i++)
        if (nums[i] > max_num)
            // fill in the missing line here
    return max_num
}

1. nums[i] = max_num

2. max_num += 1

3. max_num = nums[i]

4. max_num += nums[i]