国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 學院 > 開發設計 > 正文

LeetCode -- Minimum Number of Arrows to Burst Balloons

2019-11-08 02:11:02
字體:
來源:轉載
供稿:網友
題目描述: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:2Explanation: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).用最少數量的箭打完氣球。氣球的輸入以二維數組point[,]表示,其中氣球points[i,0]和points[i,1]表示氣球橫坐標的起始位置。實現思路:對氣球位置進行排序,從左向右依次打,每次以當前氣球最右邊的橫坐標進行射擊。遍歷每個氣球,如果當前氣球沒被打中,更新氣球射擊位置。實現代碼:
public class Solution {    public int FindMinArrowShots(int[,] points)     {        if(points == null){            return 0;        }        var len = points.GetLength(0);    	if(len == 0){    	    return 0;    	}    	    	var balls = new List<Balloon>(len);    	for (var i = 0;i < len; i++){    		balls.Add(new Balloon(points[i,0], points[i,1]));    	}    	    	balls = balls.OrderBy(x=>x.X1).ThenBy(x=>x.X2).ToList();    	//Console.WriteLine(balls);    	var bulletCount = 1;    	var selection = balls.First();    	var bulletX = selection.X2;    	for (var i = 1;i < balls.Count; i++){    		if(balls[i].X1 <= bulletX){    			bulletX = Math.Min(bulletX, balls[i].X2);    		}else{    			bulletX = balls[i].X2;    			bulletCount++;    		}    	}    	    	//Console.WriteLine(balls);    	    	    	return bulletCount;    }        public class Balloon{    	public int X1;    	public int X2;    	public Balloon(int x1, int x2){    		X1 = x1;    		X2 = x2;    	}    }}
發表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發表
主站蜘蛛池模板: 治县。| 兴城市| 独山县| 浦城县| 融水| 尚志市| 濮阳市| 神木县| 察隅县| 嵩明县| 遂平县| 芦溪县| 庄河市| 日喀则市| 新安县| 资溪县| 孟连| 淮阳县| 隆化县| 大英县| 泽州县| 罗江县| 辛集市| 即墨市| 弥渡县| 克什克腾旗| 益阳市| 和林格尔县| 凉城县| 寿光市| 惠东县| 景洪市| 榆林市| 台中市| 时尚| 阿克苏市| 太谷县| 沅陵县| 温宿县| 治县。| 基隆市|