How to use greedy algorithm in LeetCode

This article mainly introduces LeetCode how to use the greedy algorithm, has a certain reference value, interested friends can refer to, I hope you can learn a lot after reading this article, the following let the editor take you to understand it.

one

Topic description

Given an array candies and an integer extraCandies, where candies [I] represents the number of sweets owned by the first child. For each child, check to see if there is a plan to allocate extra extraCandies candies to the child, who has the most sweets. Allow multiple children to have the maximum number of candies at the same time. For example, enter [2, 3, 5, 5, 1, 3, 3, and return [true,true,true,false,true].

two

Answer to the question

Idea: the greedy algorithm wants the first child to have the most candy, so it is good to give him all the candy. If the child still can't have the most candy after giving him the most candy, it means that there is no suitable plan for the child. Class Solution: def kidsWithCandies (self, candies: List [int], extraCandies: int)-> List [bool]: a = max (candies)-extraCandies return [candy > = a for candy in candies] Thank you for reading this article carefully. I hope the article "how LeetCode uses greedy algorithms" shared by the editor will be helpful to you. At the same time, I hope you will support us and pay attention to the industry information channel. More related knowledge is waiting for you to learn!