Leetcode 228. summary interval (yes, solved)

Given a No repeating elements Of Orderly An array of integers nums .

return Just over all the numbers in the array Of Minimum order List of ranges . in other words ,nums Every element of is just covered by an interval , And there's no existence that belongs to a certain range but doesn't belong to nums The number of x .

Each range in the list [a,b] It should be output in the following format ：

• “a->b” , If a != b
• “a” , If a == b

Example 1：

 Input ：nums = [0,1,2,4,5,7]
 Output ：<