Package g0201_0300.s0228_summary_ranges
Class Solution
java.lang.Object
g0201_0300.s0228_summary_ranges.Solution
228 - Summary Ranges.<p>Easy</p>
<p>You are given a <strong>sorted unique</strong> integer array <code>nums</code>.</p>
<p>Return <em>the <strong>smallest sorted</strong> list of ranges that <strong>cover all the numbers in the array exactly</strong></em>. That is, each element of <code>nums</code> is covered by exactly one of the ranges, and there is no integer <code>x</code> such that <code>x</code> is in one of the ranges but not in <code>nums</code>.</p>
<p>Each range <code>[a,b]</code> in the list should be output as:</p>
<ul>
<li><code>"a->b"</code> if <code>a != b</code></li>
<li><code>"a"</code> if <code>a == b</code></li>
</ul>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> nums = [0,1,2,4,5,7]</p>
<p><strong>Output:</strong> [“0->2”,“4->5”,“7”]</p>
<p><strong>Explanation:</strong> The ranges are: [0,2] –> “0->2” [4,5] –> “4->5” [7,7] –> “7”</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> nums = [0,2,3,4,6,8,9]</p>
<p><strong>Output:</strong> [“0”,“2->4”,“6”,“8->9”]</p>
<p><strong>Explanation:</strong> The ranges are: [0,0] –> “0” [2,4] –> “2->4” [6,6] –> “6” [8,9] –> “8->9”</p>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> nums = []</p>
<p><strong>Output:</strong> []</p>
<p><strong>Example 4:</strong></p>
<p><strong>Input:</strong> nums = [-1]</p>
<p><strong>Output:</strong> [“-1”]</p>
<p><strong>Example 5:</strong></p>
<p><strong>Input:</strong> nums = [0]</p>
<p><strong>Output:</strong> [“0”]</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>0 <= nums.length <= 20</code></li>
<li><code>-2<sup>31</sup> <= nums[i] <= 2<sup>31</sup> - 1</code></li>
<li>All the values of <code>nums</code> are <strong>unique</strong>.</li>
<li><code>nums</code> is sorted in ascending order.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
summaryRanges
-