diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/min_num_arrow_balloon.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/min_num_arrow_balloon.cpp')
-rw-r--r-- | other/min_num_arrow_balloon.cpp | 30 |
1 files changed, 30 insertions, 0 deletions
diff --git a/other/min_num_arrow_balloon.cpp b/other/min_num_arrow_balloon.cpp new file mode 100644 index 0000000..8c79da0 --- /dev/null +++ b/other/min_num_arrow_balloon.cpp @@ -0,0 +1,30 @@ +#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 +} |