diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/min_num_arrow_balloon.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/min_num_arrow_balloon.cpp')
-rw-r--r-- | other/min_num_arrow_balloon.cpp | 30 |
1 files changed, 0 insertions, 30 deletions
diff --git a/other/min_num_arrow_balloon.cpp b/other/min_num_arrow_balloon.cpp deleted file mode 100644 index 8c79da0..0000000 --- a/other/min_num_arrow_balloon.cpp +++ /dev/null @@ -1,30 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int findMinArrowShots(vvd & points) { - if (points.size() == 0) - return 0; - sort(points.begin(), points.end(), cmp); - int arrows = 1, end = points[0][1]; - for (int i = 1; i < points.size(); i++) - if (points[i][0] > end) { - arrows++; - end = points[i][1]; - } - return arrows; - } - -private: - static bool cmp(vector<int> &x, vector<int> &y) { return x[1] < y[1]; } -}; - -int main() { - Solution obj; - vvd points1 = {{10, 16}, {2, 8}, {1, 6}, {7, 12}}, - points2 = {{1, 2}, {3, 4}, {5, 6}, {7, 8}}, - points3 = {{1, 2}, {2, 3}, {3, 4}, {4, 5}}; - cout << obj.findMinArrowShots(points1) << endl; // expect: 2 - cout << obj.findMinArrowShots(points2) << endl; // expect: 4 - cout << obj.findMinArrowShots(points3) << endl; // expect: 2 -} |