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 ...

...