Package g0201_0300.s0228_summary_ranges

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    228 - Summary Ranges.

    Easy

    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

    Output: "0->2","4->5","7"

    Explanation: The ranges are: 0,2 --> "0->2" 4,5 --> "4->5" 7,7 --> "7"

    Example 2:

    Input: nums = 0,2,3,4,6,8,9

    Output: "0","2->4","6","8->9"

    Explanation: The ranges are: 0,0 --> "0" 2,4 --> "2->4" 6,6 --> "6" 8,9 --> "8->9"

    Example 3:

    Input: nums = []

    Output: []

    Example 4:

    Input: nums = -1

    Output: "-1"

    Example 5:

    Input: nums = 0

    Output: "0"

    Constraints:

    • 0 <= nums.length <= 20

    • <code>-2<sup>31</sup><= numsi<= 2<sup>31</sup> - 1</code>

    • All the values of nums are unique.

    • nums is sorted in ascending order.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final List<String> summaryRanges(IntArray nums)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait