题意:一个数组只含有0或1,1表示该元素可以覆盖其自身.左边r-1个元素和右边r-1个元素,问最少保留多少个1元素可以覆盖整个数组. 思路:一个指针指向当前未被覆盖的最左边的元素下标,每次找离它最远且能够覆盖它的一个1元素来覆盖,并更新指针. #include<iostream> #include <string.h> #include<cstdio> using namespace std; int main() { int n,r; while(scanf(&quo…

Winter is coming! Your first job during the contest is to design a standard heater with fixed warm radius to warm all the houses. Now, you are given positions of houses and heaters on a horizontal line, find out minimum radius of heaters so that all…

Winter is coming! Your first job during the contest is to design a standard heater with fixed warm radius to warm all the houses. Now, you are given positions of houses and heaters on a horizontal line, find out minimum radius of heaters so that all…

https://leetcode.com/problems/heaters/ 开始的时候,下面的代码对于两边数字完全一样的情况,测试不通过.原因是heater会有重复情况,这时候对于飘红部分就不会往前面继续检查.所以把<改成<=让相同的情况也继续往前面走,走到最后一个,就可以了.Accepted! package com.company; import java.util.Arrays; class Solution { public int findRadius(int[] houses,…

Winter is coming! Your first job during the contest is to design a standard heater with fixed warm radius to warm all the houses. Now, you are given positions of houses and heaters on a horizontal line, find out minimum radius of heaters so that all…

Winter is coming! Your first job during the contest is to design a standard heater with fixed warm radius to warm all the houses. Now, you are given positions of houses and heaters on a horizontal line, find out minimum radius of heaters so that all…

这是悦乐书的第239次更新,第252篇原创 01 看题和准备 今天介绍的是LeetCode算法题中Easy级别的第106题(顺位题号是475).冬天来了!您在比赛期间的第一份工作是设计一个固定温暖半径的标准加热器,以加热所有房屋.现在,您可以在水平线上获得房屋和加热器的位置,找出加热器的最小半径,以便所有房屋都能被这些加热器覆盖.因此,您的输入将分别是房屋和加热器的位置,您的预期输出将是加热器的最小半径.例如: 输入:[1,2,3],[2] 输出:1 说明:唯一的加热器在位置2,如果我们使用半径…

problem 475. Heaters solution1: class Solution { public: int findRadius(vector<int>& houses, vector<int>& heaters){ , cur = , j = ; sort(houses.begin(), houses.end()); sort(heaters.begin(), heaters.end()); ; i<houses.size(); i++) {…

static int wing=[]() { std::ios::sync_with_stdio(false); cin.tie(NULL); ; }(); class Solution { public: int findRadius(vector<int>& houses, vector<int>& heaters) { sort(heaters.begin(),heaters.end()); ; int szHouses=houses.size(); ;i&l…

Winter is coming! Your first job during the contest is to design a standard heater with fixed warm radius to warm all the houses. Now, you are given positions of houses and heaters on a horizontal line, find out minimum radius of heaters so that all…