1. var findMinArrowShots = function(points) {
    2.     if (points.length === 0) return 0;
    3.     points.sort((a, b) => a[1] - b[1]);
    4.     let cnt = 1;
    5.     let resArr = [points[0]];
    6.     let curr, last;
    7.     for (let i = 1; i < points.length; i++) {
    8.         curr = points[i];
    9.         last = resArr[resArr.length - 1];
    10.         if (curr[0] > last[1]) {
    11.             resArr.push(curr);
    12.             cnt++;
    13.         }
    14.     }
    15.     return cnt;
    16. };
    1. class Solution:
    2.     def findMinArrowShots(self, points: List[List[int]]) -> int: #[[zuo,you]]
    3.         if not points:
    4.             return 0
    5.         points.sort(key=lambda x:x[1])
    6.         ans = 1
    7.         biu = points[0][1]
    8.         for ball in points:
    9.             if ball[0]<=biu:
    10.                 continue
    11.             else:
    12.                 ans+=1
    13.                 biu = ball[1]
    14.         return ans