LeetCode-Solutions-in-Cpp17

Solutions to high-frequency interview questions of LeetCode in C++17, taking into account both efficiency and comprehensibility.

---

Project maintained by downdemo Hosted on GitHub Pages — Theme by mattgraham

• 按右边界排序，从第一个右边界开始射箭，计算能引爆的气球数量，不能引爆时再换成下一个未引爆的气球的右边界

class Solution {
 public:
  int findMinArrowShots(vector<vector<int>>& points) {
    if (empty(points)) {
      return 0;
    }
    sort(begin(points), end(points),
         [](vector<int>& x, vector<int>& y) { return x[1] < y[1]; });
    int res = 1;
    int t = points[0][1];
    for (auto& x : points) {
      if (t >= x[0] && t <= x[1]) {
        continue;
      } else {
        t = x[1];
        ++res;
      }
    }
    return res;
  }
};