From a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 Mon Sep 17 00:00:00 2001 From: Jack Sangdahl Date: Fri, 27 Jun 2025 12:23:02 -0600 Subject: chore: remove old cpp and rust solutions --- other/non_overlapping_interval.cpp | 38 -------------------------------------- 1 file changed, 38 deletions(-) delete mode 100644 other/non_overlapping_interval.cpp (limited to 'other/non_overlapping_interval.cpp') diff --git a/other/non_overlapping_interval.cpp b/other/non_overlapping_interval.cpp deleted file mode 100644 index 228f691..0000000 --- a/other/non_overlapping_interval.cpp +++ /dev/null @@ -1,38 +0,0 @@ -// 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 &a, vector &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 prev = intervals[0]; - for (vector 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 -} -- cgit v1.2.3