[LeetCode] Missing Ranges

最新推荐文章于 2019-07-27 23:35:49 发布

转载最新推荐文章于 2019-07-27 23:35:49 发布 · 131 阅读

本文详细解析了一种算法，该算法用于找出一个已排序整数数组中从lower到upper范围内的缺失区间。举例来说，若数组为[0,1,3,50,75]，lower=0且upper=99，则返回的缺失区间为[24->4951->7476->99]。通过遍历数组并比较当前元素与预期元素的差异，算法能够高效地找出所有缺失的区间。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Missing Ranges

Given a sorted integer array where the range of elements are [lower, upper] inclusive, return its missing ranges.

For example, given [0, 1, 3, 50, 75], lower = 0 and upper = 99, return ["2", "4->49", "51->74", "76->99"].

 1 class Solution {
 2 public:
 3     vector<string> findMissingRanges(vector<int>& nums, int lower, int upper) {
 4         vector<string> res;
 5         for (int i = 0; i < nums.size() && nums[i] <= upper; ++i) {
 6             while (i < nums.size() && nums[i] == lower) {
 7                 ++i;
 8                 ++lower;
 9             }
10             if (i >= nums.size()) break;
11             if (nums[i] == lower + 1) {
12                 res.push_back(to_string(lower));
13             } else {
14                 res.push_back(to_string(lower) + "->" + to_string(nums[i]-1));
15             }
16             lower = nums[i] + 1;
17         }
18         if (lower == upper) {
19             res.push_back(to_string(lower));
20         } else if (lower < upper) {
21             res.push_back(to_string(lower) + "->" + to_string(upper));
22         }
23         return res;
24     }
25 };