贪心·invariant模式

加油站

The Gas Station problem requires finding the starting station index for a full circular trip with gas stations and costs…

分发糖果

The Candy problem is a greedy algorithm challenge where you need to minimize candy distribution while satisfying certain…

最大数

The problem asks to arrange integers to form the largest possible number, focusing on greedy algorithms and string handl…

摆动排序 II

Rearrange an array in a way that every odd-indexed element is greater than its adjacent even-indexed elements.

按要求补齐数组

Patching Array requires adding the minimum numbers to cover all sums from 1 to n using greedy choices and invariant chec…

递增的三元子序列

Identify if an array contains a strictly increasing triplet by maintaining a running minimal and middle value efficientl…

最长回文串

Determine the length of the longest palindrome constructible from a given string using greedy counting and frequency tra…

强密码检验器

The Strong Password Checker problem challenges you to optimize password strength while minimizing steps using greedy alg…

用最少数量的箭引爆气球

Find the minimum number of arrows needed to burst all balloons by considering greedy choice and invariant validation.

IPO

Maximize total capital by selecting up to k projects, based on initial capital and project profits using a greedy strate…

超级洗衣机

Calculate the minimum moves to balance dresses across washing machines using a greedy strategy and invariant validation …

数组拆分

Maximize the sum of minimums of n pairs in a 2n integer array using a greedy pairing strategy efficiently.

种花问题

Determine if n new flowers can be planted in a flowerbed, ensuring no adjacent flowers using a greedy approach.

数组列表中的最大距离

Maximum Distance in Arrays uses a greedy running minimum and maximum from previous arrays to validate cross array distan…

课程表 III

Solve the 'Course Schedule III' problem with a greedy approach involving course selection and validation of constraints.

最大交换

Given an integer, swap at most two digits once to produce the largest possible number using greedy digit selection.

单调递增的数字

Determine the largest number less than or equal to n with digits in non-decreasing order using a greedy, invariant-drive…

设置交集大小至少为2

Solve the Set Intersection Size At Least Two problem using a greedy approach and invariant validation.

重构字符串

Reorganize a string so that no two adjacent characters are the same, if possible, using a greedy approach.

保持城市天际线

Maximize building heights in a city grid without changing the skyline, using greedy selection constrained by row and col…

雇佣 K 名工人的最低成本

Find the minimum cost to hire exactly k workers based on quality and wage expectations in this challenging greedy proble…

柠檬水找零

Determine if you can provide exact change to every customer at a lemonade stand using greedy bill management techniques.

翻转矩阵后的得分

Maximize the score of a binary matrix by flipping rows and columns using a greedy approach and validation of invariants.

最小差值 II

Determine the minimum possible difference between the largest and smallest numbers after adjusting each by plus or minus…