LeetCode352. Data Stream as Disjoint Intervals

Given a data stream input of non-negative integers a1, a2, ..., an, ..., summarize the numbers seen so far as a list of disjoint intervals.

For example, suppose the integers from the data stream are 1, 3, 7, 2, 6, ..., then the summary will be:

[1, 1]
[1, 1], [3, 3]
[1, 1], [3, 3], [7, 7]
[1, 3], [7, 7]
[1, 3], [6, 7]

 

Follow up:

What if there are lots of merges and the number of disjoint intervals are small compared to the data stream's size?

我们使用set来纪录输入的数字（以达到去重的效果），然后在调用函数【getIntervals】时生成区间。

class SummaryRanges {
private:
	set<int> s;
public:
	/** Initialize your data structure here. */
	SummaryRanges() {

	}

	void addNum(int val) {
		s.insert(val);
	}

	vector<vector<int>> getIntervals() {
		vector<int> v(s.begin(), s.end());
		vector<vector<int>> ans;
		int left = 0, right = 0;
		while (right < v.size()) {
			if (right + 1 < v.size() && v[right + 1] == v[right] + 1) right++;
			else {
				ans.push_back({ v[left], v[right] });
				right++;
				left = right;
			}
		}
		return ans;
	}
};