Leetcode 163. Missing Ranges

Given a sorted array of distinct integers and inclusive lower/upper bounds, find all numbers or continuous ranges within [lower, upper] that are not present in the array and return each missing entry as a string ("x" for a single number or "a->b" for a range).