描述：给定链表 head，对于每个节点，查找其右侧第一个值严格大于它的节点。返回整数数组 answer，answer[i] 为第 i 个节点的下一个更大节点值；若无，则为 0。
Volunteer moderators help run the site by managing specific communities and ensure users stick to the rules and keep to the subject.
，更多细节参见夫子
Not the day you're after? Here's the solution to today's Mini Crossword.，更多细节参见同城约会
int bucketIdx = (arr[i] * bucketCount) / (max + 1); // 均匀映射