This question is about implementing a basic elimination algorithm for Candy Crush. Given a 2D integer array board representing the grid of candy ...

There are N children standing in a line. Each child is assigned a rating value. You are giving c ...

Alice and Bob have candy bars of different sizes: `A[i]` is the size of the `i`-th bar of candy that Alice has, and `B[j]` is the size of the `j`-th ...

题目大概意思就是给你一些孩子的rating，这些孩子站成一个直线，相邻的孩子rating高的一定要比rating低的孩子的candy多 所有孩子至少有一个candy。 问最少发多少个candy（好抠） 最少呢，我们当然就是保证再满足限制条件下尽量少发candy给孩子。 那限制条件 ...

题目地址：here 题目大意：几个小孩站一排，每个小孩有个等级值，现在给小孩发糖，发的时候要遵守2个规则：（1）每个小孩至少一颗糖（2）两个相邻的小孩中，等级大的小孩一定比等级小的小孩糖多，求发糖的 ...

原题： There are N children standing in a line. Each child is assigned a rating value. You are giving ...

Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy ...

...