Given a sorted integer array nums with all distinct values, return the smallest list of ranges that exactly covers every number in nums.

A range represents a maximal consecutive sequence of integers in nums. For each such sequence:
If the sequence contains exactly one number x, output the string "x".
Otherwise, if the sequence starts at a and ends at b, output the string "a->b".

Return the ranges in the same order as they appear in nums.

Constraints:

• $0 \leq$ nums.length $\leq 20$

• $-2^{31} \leq$ nums[i] $\leq 2^{31} - 1$

• All values in nums are unique.

• nums is sorted in ascending order.

Input: nums = []-List[int]
Output: []-List[str]
Explanation: The array is empty, so there are no numbers to cover and thus no ranges to return.

Input: nums = [-5]-List[int]
Output: ["-5"]-List[str]
Explanation: There is only one number, so it forms a single range of length 1 and is written as "x".

Input: nums = [-10, -9, -8, -3, 0, 1, 2, 10]-List[int]
Output: ["-10->-8", "-3", "0->2", "10"]-List[str]
Explanation: -10, -9, -8 are consecutive, giving "-10->-8"; -3 stands alone, giving "-3"; 0, 1, 2 are consecutive, giving "0->2"; and 10 stands alone, giving "10".

Input: nums = [-2147483648, -2147483647, -2147483646, 2147483645, 2147483646, 2147483647]-List[int]
Output: ["-2147483648->-2147483646", "2147483645->2147483647"]-List[str]
Explanation: The first three values are consecutive near the minimum 32-bit integer, giving "-2147483648->-2147483646", and the last three values are consecutive near the maximum 32-bit integer, giving "2147483645->2147483647".

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.