aboutsummaryrefslogtreecommitdiff
path: root/other/non_overlapping_interval.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
committerJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
commit7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch)
treeeb7a24ee2067f92245c57bb118e85a1baf15df50 /other/non_overlapping_interval.cpp
parent5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff)
downloadleetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz
leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip
chore: move cpp and rust code to directory
Diffstat (limited to 'other/non_overlapping_interval.cpp')
-rw-r--r--other/non_overlapping_interval.cpp38
1 files changed, 38 insertions, 0 deletions
diff --git a/other/non_overlapping_interval.cpp b/other/non_overlapping_interval.cpp
new file mode 100644
index 0000000..228f691
--- /dev/null
+++ b/other/non_overlapping_interval.cpp
@@ -0,0 +1,38 @@
+// 435. Non-overlapping Intervals
+#include "leetcode.h"
+
+/*
+ * given an array of intervals 'intervals' where 'intervals[i] = [start[i],
+ * end[i]]', return the minimum number of intervals you need to remove to make
+ * the rest of the intervals non-overlapping
+ */
+
+class Solution {
+ static bool cmp(vector<int> &a, vector<int> &b) { return a[1] < b[1]; }
+
+public:
+ int eraseOverlapIntervals(vvd & intervals) {
+ int ans = -1;
+ if (!intervals.size())
+ return 0;
+ sort(intervals.begin(), intervals.end(), cmp);
+ vector<int> prev = intervals[0];
+ for (vector<int> i : intervals) {
+ if (prev[1] > i[0])
+ ans++;
+ else
+ prev = i;
+ }
+ return ans;
+ }
+};
+
+int main() {
+ Solution obj;
+ vvd i1 = {{1, 2}, {2, 3}, {3, 4}, {1, 3}};
+ vvd i2 = {{1, 2}, {1, 2}, {1, 2}};
+ vvd i3 = {{1, 2}, {2, 3}};
+ printf("%d\n", obj.eraseOverlapIntervals(i1)); // expect: 1
+ printf("%d\n", obj.eraseOverlapIntervals(i2)); // expect: 2
+ printf("%d\n", obj.eraseOverlapIntervals(i3)); // expect: 0
+}