# Leetcode 228 - Summary ranges

`Note:`

- Two while loops.
- One to iterate to the end.
- One to iterate until
`nums[i+1] !== nums[i] + 1`

.

`Question:`

You are given a sorted unique integer array `nums`

.

Return the smallest sorted list of ranges that cover all the numbers in the array exactly. That is, each element of nums is covered by exactly one of the ranges, and there is no integer x such that x is in one of the ranges but not in nums.

Each range [a,b] in the list should be output as:

`"a->b"`

if`a != b`

`"a"`

if`a == b`

`Example:`

1 | Input: nums = [0,1,2,4,5,7] |

`Code:`

1 | /** |