Skip to content

Commit db22a71

Browse files
BarklimBarklim
Barklim
authored and
Barklim
committed
add intervals
1 parent f96350b commit db22a71

File tree

7 files changed

+111
-2
lines changed

7 files changed

+111
-2
lines changed

‎example/9.Intervals/0056.js

Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
/**
2+
* @param {number[][]} intervals
3+
* @return {number[][]}
4+
*/
5+
var merge = function(intervals) {
6+
7+
};
8+
9+
const example1 = merge([[1,3],[2,6],[8,10],[15,18]]); // [[1,6],[8,10],[15,18]]
10+
const example2 = merge([[1,4],[4,5]]); // [[1,5]]
11+
const example3 = merge([[1,3],[1,5],[6,7]]); // [[1,5],[6,7]]
12+
const example4 = merge([[1,2],[2,3]]); // [[1,3]]
13+
14+
console.log(example1);
15+
console.log(example2);
16+
console.log(example3);
17+
console.log(example4);

‎example/9.Intervals/0057.js

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
/**
2+
* @param {number[][]} intervals
3+
* @param {number[]} newInterval
4+
* @return {number[][]}
5+
*/
6+
var insert = function(intervals, newInterval) {
7+
8+
};
9+
10+
const example1 = insert([[1,3],[6,9]], [2,5]); // [[1,5],[6,9]]
11+
const example2 = insert([[1,2],[3,5],[6,7],[8,10],[12,16]], [4,8]); // [[1,2],[3,10],[12,16]]
12+
const example3 = insert([[1,3],[4,6]], [2,5]); // [[1,6]]
13+
const example4 = insert([[1,2],[3,5],[9,10]], [6,7]); // [[1,2],[3,5],[6,7],[9,10]]
14+
15+
console.log(example1);
16+
console.log(example2);
17+
console.log(example3);
18+
console.log(example4);

‎example/9.Intervals/0252.js

Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
/**
2+
* @param {Interval[]} intervals
3+
* @returns {boolean}
4+
*/
5+
var canAttendMeetings = function (intervals) {
6+
7+
};
8+
9+
const example1 = canAttendMeetings(); //
10+
const example2 = canAttendMeetings(); //
11+
const example3 = canAttendMeetings([(0,30),(5,10),(15,20)]); // false
12+
const example4 = canAttendMeetings([(5,8),(9,15)]); // true
13+
14+
console.log(example1);
15+
console.log(example2);
16+
console.log(example3);
17+
console.log(example4);

‎example/9.Intervals/0253.js

Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
/**
2+
* @param {Interval[]} intervals
3+
* @returns {number}
4+
*/
5+
var minMeetingRooms = function(intervals) {
6+
7+
};
8+
9+
const example1 = merge(); // [[1,6],[8,10],[15,18]]
10+
const example2 = merge(); // [[1,5]]
11+
const example3 = merge([(0,40),(5,10),(15,20)]); // 2
12+
const example4 = merge([(4,9)]); // 1
13+
14+
console.log(example1);
15+
console.log(example2);
16+
console.log(example3);
17+
console.log(example4);

‎example/9.Intervals/0435.js

Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
/**
2+
* @param {number[][]} intervals
3+
* @return {number[][]}
4+
*/
5+
var eraseOverlapIntervals = function(intervals) {
6+
7+
};
8+
9+
const example1 = eraseOverlapIntervals([[1,2],[2,3],[3,4],[1,3]]); // 1
10+
const example2 = eraseOverlapIntervals([[1,2],[1,2],[1,2]]); // 2
11+
const example3 = eraseOverlapIntervals([[1,2],[2,3]]); // 0
12+
const example4 = eraseOverlapIntervals([[1,2],[2,4],[1,4]]); // 1
13+
const example5 = eraseOverlapIntervals([[1,2],[2,4]]); // 0
14+
15+
console.log(example1);
16+
console.log(example2);
17+
console.log(example3);
18+
console.log(example4);
19+
console.log(example5);

‎example/9.Intervals/1851.js

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
/**
2+
* @param {number[][]} intervals
3+
* @param {number[]} queries
4+
* @return {number[]}
5+
*/
6+
var minInterval = function(intervals, queries) {
7+
8+
};
9+
10+
const example1 = minInterval([[1,4],[2,4],[3,6],[4,4]], [2,3,4,5]); // [3,3,1,4]
11+
const example2 = minInterval([[2,3],[2,5],[1,8],[20,25]], [2,19,5,22]); // [2,-1,4,6]
12+
const example3 = minInterval([[1,3],[2,3],[3,7],[6,6]], [2,3,1,7,6,8]); // [2,2,3,5,1,-1]
13+
const example4 = minInterval([[1,2],[2,3]]); // [[1,3]]
14+
15+
console.log(example1);
16+
console.log(example2);
17+
console.log(example3);
18+
console.log(example4);

‎example/README.md

Lines changed: 5 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -142,7 +142,7 @@ Better order to solve problems
142142
211. Design Add and Search Words Data Structure
143143
212. Word Search II
144144

145-
### [Heap Pt.1]((https://github.com/Barklim/leetcode-javascript/tree/master/example/8.Heap))
145+
### [Heap Pt.1](https://github.com/Barklim/leetcode-javascript/tree/master/example/8.Heap)
146146

147147
215. Kth Largest Element in an Array (минхипа максхипа)
148148
703. Kth Largest Element in a Stream
@@ -158,12 +158,15 @@ Better order to solve problems
158158
23. Merge k sorted Lists
159159
642. Design Search Autocomplete System
160160

161-
### Intervals
161+
### [Intervals](https://github.com/Barklim/leetcode-javascript/tree/master/example/9.Intervals)
162162

163163
252. Meeting Rooms (сортировать по дате начала митинга)
164164
56. Merge Intervals
165165
57. Insert Intervals
166166
253. Meeting Rooms ii
167+
0.
168+
435. Non-overlapping Intervals
169+
1851. Minimum Interval to Include Each Query
167170

168171
### Graphs Workshop
169172

0 commit comments

Comments
 (0)