标签：right shot Burst 452 Arrows number points arrow balloons

package LeetCode_452

/**
 * 452. Minimum Number of Arrows to Burst Balloons
 * https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/description/
 *
 * 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 104 balloons.
An arrow can be shot up exactly vertically from different points along the x-axis.
A balloon with xstart and xend bursts by an arrow shot at x if xstart ≤ x ≤ xend.
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).
 * */
class Solution {
    /*
    * solution: sort array increasing by right, then keep tracking the right
    * Time complexity:O(nlogn), Space complexity:O(n)
    * */
    fun findMinArrowShots(points: Array<IntArray>): Int {
        if (points == null || points.isEmpty()) {
            return 0
        }
        //have one balloon, need one arrow
        var result = 1
        //sorting by the right
        points.sortWith(Comparator { a, b -> a[1] - b[1] })
        var right = points[0][1]
        for (item in points) {
            //if left large than current right, mean need new arrow
            if (item[0] > right) {
                right = item[1]
                result++
            }
        }
        return result
    }
}

标签：right,shot,Burst,452,Arrows,number,points,arrow,balloons
来源： https://www.cnblogs.com/johnnyzhao/p/13374950.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。