LeetCode 452. Minimum Number of Arrows to Burst Balloons 射击气球所需最少弓箭手数量

Question:

There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it's horizontal, y-coordinates don't matter and hence the x-coordinates of start and end of the diameter suffice. Start is always smaller than end. There will be at most 10⁴ balloons.

An arrow can be shot up exactly vertically from different points along the x-axis. A balloon with x_start and x_end bursts by an arrow shot at x if x_start ≤ x ≤ x_end. There is no limit to the number of arrows that can be shot. An arrow once shot keeps travelling up infinitely. The problem is to find the minimum number of arrows that must be shot to burst all balloons.

Example:

Input:
[[10,16], [2,8], [1,6], [7,12]]

Output:
2

Explanation:
One way is to shoot one arrow for example at x = 6 (bursting the balloons [2,8] and [1,6]) and another arrow at x = 11 (bursting the other two balloons).

思路：

贪心算法。尽可能一个弓箭手能同时打爆多个气球。所以弓箭手的shoot应为几个气球交集。首先，需要给气球的按左端点排序。如果气球左端点小于等于弓箭手的右端点，则将弓箭手的做端点赋值为气球左端点，尽可能求交集，同时如果气球右端点小于弓箭手右端点，则把弓箭手的右端点赋值为气球的右端点，保证弓箭手的射击范围是气球的交集处。如果气球左端点小于弓箭手的右端点，则说明该气球不可能与之前的气球形成交集，那么弓箭手数量+1，同时给射击范围赋新值。

class Solution {
    public int findMinArrowShots(int[][] points) {
        int len1 = points.length;
        if(len1 < 1)
            return 0;
        //先得将气球按左端点大小排序，无需考虑右端点，也无需考虑左端点相等
        Arrays.sort(points, new Comparator<int[]>() {
		public int compare(int[] a, int[] b) {
			//if(a[0]==b[0]) return a[1]-b[1];
			//else return a[0]-b[0];
            return a[0]-b[0];
		}
      	});
        int arr_nums = 0;
        int shoot[] = new int[points[0].length];
        shoot[0] = points[0][0];
        shoot[1] = points[0][1];//把第一个气球的距离赋给shot
        for(int i=1;i<len1;i++)
        {
            //if(shoot[0]<points[i][0])错误
            //如果气球左端点小于等于弓箭手的右端点
            if(points[i][0]<=shoot[1])
            {   
                //将弓箭手的做端点赋值为气球左端点
                shoot[0]=points[i][0];     
                //如果气球右端点小于弓箭手右端点
                if(shoot[1]>points[i][1])
                    //把弓箭手的右端点赋值为气球的右端点，保证弓箭手的射击范围是气球的交集处
                   shoot[1]=points[i][1];
             }
            //如果气球左端点小于弓箭手的右端点，则说明该气球不可能与之前的气球形成交集，那么弓箭手数量+1，同时给射击范围赋新值。
           else{
                arr_nums++; 
                shoot[0] = points[i][0];
                shoot[1] = points[i][1];
            }
                                      
        }
        return ++arr_nums;
        
    }
}

博主学习笔记，转载请注明出处，谢谢~