Skip to content

Commit e0db7ab

Browse files
changjianzouchangjianzou
committed
Insert Interval
1 parent 244ac1c commit e0db7ab

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

50 files changed

+596
-0
lines changed

‎.metadata/.plugins/org.eclipse.cdt.core/Intervals.1391109833957.pdom

4 KB
Binary file not shown.

‎.metadata/.plugins/org.eclipse.core.resources/.history/0/50e542d03d8a00131359ef65d83f19b2

+38
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
struct Interval {
2+
* int start;
3+
* int end;
4+
Interval() : start(0), end(0) {}
5+
Interval(int s, int e) : start(s), end(e) {}
6+
};
7+
8+
class Solution {
9+
public:
10+
11+
//linear scan
12+
vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
13+
14+
vector<Interval> ret;
15+
16+
int i = 0;
17+
18+
while(i < intervals.size() && newInterval.start > intervals[i].end)
19+
{
20+
ret.push_back(intervals[i]);
21+
i++;
22+
}
23+
24+
if( i < intervals.size() && newInterval.start > intervals[i].start) newInterval.start = intervals[i].start;
25+
26+
while(i < intervals.size() && newInterval.end >= intervals[i].end)
27+
{
28+
i++;
29+
}
30+
31+
if(i < intervals.size() && newInterval.end >= intervals[i].start) {newInterval.end = intervals[i].end;i++;}
32+
33+
ret.push_back(newInterval);
34+
35+
while(i < intervals.size()) {ret.push_back(intervals[i]); i++;}
36+
37+
return ret;
38+

‎.metadata/.plugins/org.eclipse.core.resources/.history/16/e0b30ae13d8a00131359ef65d83f19b2

+40
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,40 @@
1+
#include<vector>
2+
3+
using namespace std;
4+
5+
struct Interval {
6+
int start;
7+
int end;
8+
Interval() : start(0), end(0) {}
9+
Interval(int s, int e) : start(s), end(e) {}
10+
};
11+
12+
13+
//linear scan
14+
vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
15+
16+
vector<Interval> ret;
17+
18+
int i = 0;
19+
20+
while(i < intervals.size() && newInterval.start > intervals[i].end)
21+
{
22+
ret.push_back(intervals[i]);
23+
i++;
24+
}
25+
26+
if( i < intervals.size() && newInterval.start > intervals[i].start) newInterval.start = intervals[i].start;
27+
28+
while(i < intervals.size() && newInterval.end >= intervals[i].end)
29+
{
30+
i++;
31+
}
32+
33+
if(i < intervals.size() && newInterval.end >= intervals[i].start) {newInterval.end = intervals[i].end;i++;}
34+
35+
ret.push_back(newInterval);
36+
37+
while(i < intervals.size()) {ret.push_back(intervals[i]); i++;}
38+
39+
return ret;
40+

‎.metadata/.plugins/org.eclipse.core.resources/.history/41/b006c1cb3d8a00131359ef65d83f19b2

+39
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
1+
struct Interval {
2+
* int start;
3+
* int end;
4+
* Interval() : start(0), end(0) {}
5+
* Interval(int s, int e) : start(s), end(e) {}
6+
* };
7+
*/
8+
class Solution {
9+
public:
10+
11+
//linear scan
12+
vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
13+
14+
vector<Interval> ret;
15+
16+
int i = 0;
17+
18+
while(i < intervals.size() && newInterval.start > intervals[i].end)
19+
{
20+
ret.push_back(intervals[i]);
21+
i++;
22+
}
23+
24+
if( i < intervals.size() && newInterval.start > intervals[i].start) newInterval.start = intervals[i].start;
25+
26+
while(i < intervals.size() && newInterval.end >= intervals[i].end)
27+
{
28+
i++;
29+
}
30+
31+
if(i < intervals.size() && newInterval.end >= intervals[i].start) {newInterval.end = intervals[i].end;i++;}
32+
33+
ret.push_back(newInterval);
34+
35+
while(i < intervals.size()) {ret.push_back(intervals[i]); i++;}
36+
37+
return ret;
38+
39+
}

‎.metadata/.plugins/org.eclipse.core.resources/.history/48/20606ed73d8a00131359ef65d83f19b2

+39
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
1+
2+
struct Interval {
3+
int start;
4+
int end;
5+
Interval() : start(0), end(0) {}
6+
Interval(int s, int e) : start(s), end(e) {}
7+
};
8+
9+
class Solution {
10+
public:
11+
12+
//linear scan
13+
vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
14+
15+
vector<Interval> ret;
16+
17+
int i = 0;
18+
19+
while(i < intervals.size() && newInterval.start > intervals[i].end)
20+
{
21+
ret.push_back(intervals[i]);
22+
i++;
23+
}
24+
25+
if( i < intervals.size() && newInterval.start > intervals[i].start) newInterval.start = intervals[i].start;
26+
27+
while(i < intervals.size() && newInterval.end >= intervals[i].end)
28+
{
29+
i++;
30+
}
31+
32+
if(i < intervals.size() && newInterval.end >= intervals[i].start) {newInterval.end = intervals[i].end;i++;}
33+
34+
ret.push_back(newInterval);
35+
36+
while(i < intervals.size()) {ret.push_back(intervals[i]); i++;}
37+
38+
return ret;
39+

‎.metadata/.plugins/org.eclipse.core.resources/.history/57/9097b6d83d8a00131359ef65d83f19b2

+39
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
1+
#include<>
2+
struct Interval {
3+
int start;
4+
int end;
5+
Interval() : start(0), end(0) {}
6+
Interval(int s, int e) : start(s), end(e) {}
7+
};
8+
9+
class Solution {
10+
public:
11+
12+
//linear scan
13+
vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
14+
15+
vector<Interval> ret;
16+
17+
int i = 0;
18+
19+
while(i < intervals.size() && newInterval.start > intervals[i].end)
20+
{
21+
ret.push_back(intervals[i]);
22+
i++;
23+
}
24+
25+
if( i < intervals.size() && newInterval.start > intervals[i].start) newInterval.start = intervals[i].start;
26+
27+
while(i < intervals.size() && newInterval.end >= intervals[i].end)
28+
{
29+
i++;
30+
}
31+
32+
if(i < intervals.size() && newInterval.end >= intervals[i].start) {newInterval.end = intervals[i].end;i++;}
33+
34+
ret.push_back(newInterval);
35+
36+
while(i < intervals.size()) {ret.push_back(intervals[i]); i++;}
37+
38+
return ret;
39+

‎.metadata/.plugins/org.eclipse.core.resources/.history/61/105bf1dc3d8a00131359ef65d83f19b2

+41
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,41 @@
1+
#include<vector>
2+
3+
using namespace std;
4+
struct Interval {
5+
int start;
6+
int end;
7+
Interval() : start(0), end(0) {}
8+
Interval(int s, int e) : start(s), end(e) {}
9+
};
10+
11+
class Solution {
12+
public:
13+
14+
//linear scan
15+
vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
16+
17+
vector<Interval> ret;
18+
19+
int i = 0;
20+
21+
while(i < intervals.size() && newInterval.start > intervals[i].end)
22+
{
23+
ret.push_back(intervals[i]);
24+
i++;
25+
}
26+
27+
if( i < intervals.size() && newInterval.start > intervals[i].start) newInterval.start = intervals[i].start;
28+
29+
while(i < intervals.size() && newInterval.end >= intervals[i].end)
30+
{
31+
i++;
32+
}
33+
34+
if(i < intervals.size() && newInterval.end >= intervals[i].start) {newInterval.end = intervals[i].end;i++;}
35+
36+
ret.push_back(newInterval);
37+
38+
while(i < intervals.size()) {ret.push_back(intervals[i]); i++;}
39+
40+
return ret;
41+

‎.metadata/.plugins/org.eclipse.core.resources/.history/74/000ee6d13d8a00131359ef65d83f19b2

+38
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
struct Interval {
2+
int start;
3+
int end;
4+
Interval() : start(0), end(0) {}
5+
Interval(int s, int e) : start(s), end(e) {}
6+
};
7+
8+
class Solution {
9+
public:
10+
11+
//linear scan
12+
vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
13+
14+
vector<Interval> ret;
15+
16+
int i = 0;
17+
18+
while(i < intervals.size() && newInterval.start > intervals[i].end)
19+
{
20+
ret.push_back(intervals[i]);
21+
i++;
22+
}
23+
24+
if( i < intervals.size() && newInterval.start > intervals[i].start) newInterval.start = intervals[i].start;
25+
26+
while(i < intervals.size() && newInterval.end >= intervals[i].end)
27+
{
28+
i++;
29+
}
30+
31+
if(i < intervals.size() && newInterval.end >= intervals[i].start) {newInterval.end = intervals[i].end;i++;}
32+
33+
ret.push_back(newInterval);
34+
35+
while(i < intervals.size()) {ret.push_back(intervals[i]); i++;}
36+
37+
return ret;
38+

‎.metadata/.plugins/org.eclipse.core.resources/.history/84/c0e276cf3d8a00131359ef65d83f19b2

+38
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
struct Interval {
2+
* int start;
3+
* int end;
4+
* Interval() : start(0), end(0) {}
5+
Interval(int s, int e) : start(s), end(e) {}
6+
};
7+
8+
class Solution {
9+
public:
10+
11+
//linear scan
12+
vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
13+
14+
vector<Interval> ret;
15+
16+
int i = 0;
17+
18+
while(i < intervals.size() && newInterval.start > intervals[i].end)
19+
{
20+
ret.push_back(intervals[i]);
21+
i++;
22+
}
23+
24+
if( i < intervals.size() && newInterval.start > intervals[i].start) newInterval.start = intervals[i].start;
25+
26+
while(i < intervals.size() && newInterval.end >= intervals[i].end)
27+
{
28+
i++;
29+
}
30+
31+
if(i < intervals.size() && newInterval.end >= intervals[i].start) {newInterval.end = intervals[i].end;i++;}
32+
33+
ret.push_back(newInterval);
34+
35+
while(i < intervals.size()) {ret.push_back(intervals[i]); i++;}
36+
37+
return ret;
38+

‎.metadata/.plugins/org.eclipse.core.resources/.history/8d/60ce88cd3d8a00131359ef65d83f19b2

+38
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
struct Interval {
2+
* int start;
3+
* int end;
4+
* Interval() : start(0), end(0) {}
5+
* Interval(int s, int e) : start(s), end(e) {}
6+
* };
7+
8+
class Solution {
9+
public:
10+
11+
//linear scan
12+
vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
13+
14+
vector<Interval> ret;
15+
16+
int i = 0;
17+
18+
while(i < intervals.size() && newInterval.start > intervals[i].end)
19+
{
20+
ret.push_back(intervals[i]);
21+
i++;
22+
}
23+
24+
if( i < intervals.size() && newInterval.start > intervals[i].start) newInterval.start = intervals[i].start;
25+
26+
while(i < intervals.size() && newInterval.end >= intervals[i].end)
27+
{
28+
i++;
29+
}
30+
31+
if(i < intervals.size() && newInterval.end >= intervals[i].start) {newInterval.end = intervals[i].end;i++;}
32+
33+
ret.push_back(newInterval);
34+
35+
while(i < intervals.size()) {ret.push_back(intervals[i]); i++;}
36+
37+
return ret;
38+

‎.metadata/.plugins/org.eclipse.core.resources/.history/9d/10c84ddc3d8a00131359ef65d83f19b2

+39
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
1+
#include<vector>
2+
struct Interval {
3+
int start;
4+
int end;
5+
Interval() : start(0), end(0) {}
6+
Interval(int s, int e) : start(s), end(e) {}
7+
};
8+
9+
class Solution {
10+
public:
11+
12+
//linear scan
13+
vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
14+
15+
vector<Interval> ret;
16+
17+
int i = 0;
18+
19+
while(i < intervals.size() && newInterval.start > intervals[i].end)
20+
{
21+
ret.push_back(intervals[i]);
22+
i++;
23+
}
24+
25+
if( i < intervals.size() && newInterval.start > intervals[i].start) newInterval.start = intervals[i].start;
26+
27+
while(i < intervals.size() && newInterval.end >= intervals[i].end)
28+
{
29+
i++;
30+
}
31+
32+
if(i < intervals.size() && newInterval.end >= intervals[i].start) {newInterval.end = intervals[i].end;i++;}
33+
34+
ret.push_back(newInterval);
35+
36+
while(i < intervals.size()) {ret.push_back(intervals[i]); i++;}
37+
38+
return ret;
39+

0 commit comments

Comments
 (0)