452 Minimum Number of Arrows to Burst Balloons

文章目录

452 Minimum Number of Arrows to Burst Balloons
- 1：题目描述
- 2：解决思路
- 3：代码
- 4：正数负数相减超出范围(问题)
- 5：50%

1：题目描述

2：解决思路

先排序，从小到大
开始 < END 则整个__开始 = 开始
结尾 < END 则整个 __结尾 = 结尾
否则
- NUM++
- 整个__开始 = 新的开始
- 整个__结尾 = 新的结尾

3：代码

class Solution {public int findMinArrowShots(int[][] points) {if(points==null || points.length ==0) return 0;Arrays.sort(points, new Comparator<int[]>() {@Overridepublic int compare(int[] o1, int[] o2) {if(o1[0] <o2[0]) return -1;return 1;}});int result=1,begin=points[0][0],end=points[0][1];for(int i=1;i<points.length;i++){if(points[i][0] <= end){begin=points[i][0];if(points[i][1] < end){end=points[i][1];}}else{result++;begin=points[i][0];end=points[i][1];}}return result;}
}

4：正数负数相减超出范围(问题)

        Arrays.sort(points, new Comparator<int[]>() {@Overridepublic int compare(int[] o1, int[] o2) {return o1[0]-o2[0];}});

            public int compare(int[] o1, int[] o2) {if(o1[0] <o2[0]) return -1;return 1;}

不用减法直接比较大小

5：50%

452 Minimum Number of Arrows to Burst Balloons相关推荐

LeetCode 452 Minimum Number of Arrows to Burst Balloons(贪心法)
问题:给出n个气球,已知其在二维平面中的区间[left,right],箭只能竖直向中,气球重叠时,箭仍然可以穿过.问最少需要多少箭. 思路:贪心算法,根据右端点从小到大排序.在遍历区间时,如果当前区间 ...
leetcode 452. Minimum Number of Arrows to Burst Balloons | 452. 用最少数量的箭引爆气球（左程云：最大线段重合问题）
题目 https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/ 题解重叠区间问题可以总结为在坐标轴上若干个位 ...
leetcode算法题--Minimum Number of Arrows to Burst Balloons
原题链接:https://leetcode.com/problems/queue-reconstruction-by-height/ bool cmp(vector<int> a, vec ...
codeforce 804B Minimum number of steps
cf劲啊原题: We have a string of letters 'a' and 'b'. We want to perform some operations on it. On each ...
LeetCode——1888. 使二进制字符串字符交替的最少反转次数(Minimum Number of Flips to Make the Binary ...)[中等]——分析及代码（Java）
LeetCode--1888. 使二进制字符串字符交替的最少反转次数[Minimum Number of Flips to Make the Binary String Alternating][中等 ...
871. Minimum Number of Refueling Stops
题目: A car travels from a starting position to a destination which is target miles east of the starti ...
LeetCode刷题：871. Minimum Number of Refueling Stops
LeetCode刷题:871. Minimum Number of Refueling Stops 原题链接:https://leetcode.com/problems/minimum-number- ...
LeetCode 871. Minimum Number of Refueling Stops 最少加油次数
LeetCode 871. Minimum Number of Refueling Stops 本题是LeetCode 871题,最少加油次数. 题目描述 A car travels from a s ...
LeetCode871.Minimum Number of Refueling Stops
871.Minimum Number of Refueling Stops(加油站的最小数量) Description Difficulty: hard Example 1: Example 2: E ...

452 Minimum Number of Arrows to Burst Balloons

452 Minimum Number of Arrows to Burst Balloons

文章目录

1：题目描述

2：解决思路

3：代码

4：正数负数相减超出范围(问题)

5：50%

452 Minimum Number of Arrows to Burst Balloons相关推荐

最新文章

热门文章