贪心算法
文章平均质量分 62
Heisenberg_888
互联网工程师,努力学习中
展开
-
134. Gas Station
There arengas stations along a circular route, where the amount of gas at theithstation isgas[i].You have a car with an unlimited gas tank and it costscost[i]of gas to travel from theithstation to its next(i + 1)thstation. You begin the journe...原创 2021-03-27 16:40:23 · 154 阅读 · 0 评论 -
1094. 拼车
假设你是一位顺风车司机,车上最初有capacity个空座位可以用来载客。由于道路的限制,车只能向一个方向行驶(也就是说,不允许掉头或改变方向,你可以将其想象为一个向量)。这儿有一份乘客行程计划表trips[][],其中trips[i] = [num_passengers, start_location, end_location]包含了第 i 组乘客的行程信息:必须接送的乘客数量;乘客的上车地点;以及乘客的下车地点。这些给出的地点位置是从你的初始出发位置向前行驶到这些地点所需...原创 2020-12-09 19:46:13 · 198 阅读 · 0 评论 -
452. Minimum Number of Arrows to Burst Balloons pair<int,int>速度快很多
There are some 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原创 2020-12-07 20:35:40 · 155 阅读 · 0 评论 -
435. Non-overlapping Intervals 排序内置cmp函数
Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.Example 1:Input: [[1,2],[2,3],[3,4],[1,3]]Output: 1Explanation: [1,3] can be removed and the rest of interv.原创 2020-12-05 19:41:07 · 181 阅读 · 0 评论 -
406. Queue Reconstruction by Height list和vector的区别
You are given an array of people,people, which are the attributes of some people in a queue (not necessarily in order). Eachpeople[i] = [hi, ki]represents theithperson of heighthiwithexactlykiother people in front who have a height greater than o...原创 2020-12-03 22:09:04 · 152 阅读 · 0 评论 -
870. Advantage Shuffle
Given two arraysAandBof equal size, theadvantage ofAwith respect toBis the number of indicesifor whichA[i] > B[i].Returnanypermutation ofAthat maximizes its advantage with respect toB.Example 1:Input: A = [2,7,11,15], B = [1,1...原创 2020-12-02 21:24:19 · 152 阅读 · 0 评论 -
670. Maximum Swap
Given a non-negative integer, you could swap two digitsat mostonce to get the maximum valued number. Return the maximum valued number you could get.Example 1:Input: 2736Output: 7236Explanation: Swap the number 2 and the number 7.Example 2:...原创 2020-12-01 21:36:45 · 166 阅读 · 0 评论 -
POJ 3040 Allowance 题解
这是很棒的一个例子,由最简单的硬币问题延伸而来,很有代表性。https://www.cnblogs.com/carolunar/p/6386152.html原创 2020-05-05 18:14:17 · 510 阅读 · 2 评论 -
HDU2037贪心看电视
Problem Description“今年暑假不AC?”“是的。”“那你干什么呢?”“看世界杯呀,笨蛋!”“@#$%^&*%...”确实如此,世界杯来了,球迷的节日也来了,估计很多ACMer也会抛开电脑,奔向电视了。作为球迷,一定想看尽量多的完整的比赛,当然,作为新时代的好青年,你一定还会看一些其它的节目,比如新闻联播(永远不要忘记关心国家大事)、非常6+7、超级女生,以...原创 2018-08-01 21:15:12 · 242 阅读 · 0 评论 -
HDU4864贪心最后一题
Problem DescriptionToday the company has m tasks to complete. The ith task need xi minutes to complete. Meanwhile, this task has a difficulty level yi. The machine whose level below this task’s leve...原创 2018-08-05 21:19:11 · 322 阅读 · 1 评论 -
HDU1009贪心
Problem DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.The warehouse has N rooms. The i-th room contai...原创 2018-07-31 22:02:38 · 334 阅读 · 0 评论 -
HDU1257最少拦截系统
Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就到这里来求救...原创 2018-07-30 22:54:45 · 112 阅读 · 0 评论