nums of size n+1 with nums[0] = 0 and nums[1] = 1 if n is at least 1.maximumValue to keep track of the maximum value found so far. If n is 0, return 0.2 to n.
a. If i is even, set nums[i] to nums[i/2].
b. If i is odd, set nums[i] to nums[i/2] + nums[i/2 + 1].
c. Update maximumValue if nums[i] is greater than the current maximumValue.maximumValue.