【LeetCode笔记】Candy
来源:互联网 发布:淘宝宝贝排名靠前 编辑:程序博客网 时间:2024/06/06 09:27
Something wrong with my solution as describing below.
I got a wrong answer: Input: [1,2,4,4,3] Output: 10 Expected: 9
my output is 1+2+3+3+1 = 10. and I think OJ's is 1+2+3+2+1 = 9
how can the third child has more candies than the fourth?
But the requirement is "Children with a higher rating get more candies than their neighbors",
I don't want to deal with my code anymore, because I think this question is not well defined.
------------------------------------------------------------------------------
I found a nice code in the discussion:ref: https://oj.leetcode.com/discuss/76/does-anyone-have-a-better-idea
Here is another wonderful solution from old discuss by hawk. Thanks to hawk!
The solution is O(N) time complexity and constant memory complexity. What's more, the solution only need to go thru the ratings array once!
Reading the code with full comment to help understand the algorithm.
int candy(vector<int> &ratings) {
// Note: The Solution object is instantiated only once and is reused by each test case.
int nCandyCnt = 0;///Total candies
int nSeqLen = 0; /// Continuous ratings descending sequence length
int nPreCanCnt = 1; /// Previous child's candy count
int nMaxCntInSeq = nPreCanCnt;
if(ratings.begin() != ratings.end())
{
nCandyCnt++;//Counting the first child's candy.
for(vector<int>::iterator i = ratings.begin()+1; i!= ratings.end(); i++)
{
// if r[k]>r[k+1]>r[k+2]...>r[k+n],r[k+n]<=r[k+n+1],
// r[i] needs n-(i-k)+(Pre's) candies(k<i<k+n)
// But if possible, we can allocate one candy to the child,
// and with the sequence extends, add the child's candy by one
// until the child's candy reaches that of the prev's.
// Then increase the pre's candy as well.
// if r[k] < r[k+1], r[k+1] needs one more candy than r[k]
//
if(*i < *(i-1))
{
//Now we are in a sequence
nSeqLen++;
if(nMaxCntInSeq == nSeqLen)
{
//The first child in the sequence has the same candy as the prev
//The prev should be included in the sequence.
nSeqLen++;
}
nCandyCnt+= nSeqLen;
nPreCanCnt = 1;
}
else
{
if(*i > *(i-1))
{
nPreCanCnt++;
}
else
{
nPreCanCnt = 1;
}
nCandyCnt += nPreCanCnt;
nSeqLen = 0;
nMaxCntInSeq = nPreCanCnt;
}
}
}
return nCandyCnt;
}
- 【LeetCode笔记】Candy
- Leetcode: Candy
- LeetCode:Candy
- [leetcode]Candy
- Leetcode: Candy
- 【leetcode】Candy
- LeetCode:Candy
- [LeetCode] Candy
- [LeetCode]Candy
- [LeetCode] Candy
- 【LeetCode】Candy
- LeetCode | Candy
- Leetcode: Candy
- Candy - LeetCode
- leetcode Candy
- LeetCode Candy
- candy leetcode
- Candy -- LeetCode
- Markdown中插入数学公式的方法
- 基于Linux内核SPI子系统工作机制
- VNC登录linux后桌面不显示图标故障解决方法
- camera 管脚功能和调试分析
- linux学习路线
- 【LeetCode笔记】Candy
- Best Time to Buy and Sell Stock II
- [LeetCode] Add Binary
- IIS6,IIS7中查看w3wp进程
- SPI中的极性CPOL和相位CPHA是什么以及如何设置
- 正则表达式---简单使用
- 在Linux中jdk环境变量的配置
- Lesson 6 Testing and Debugging
- android的service组件不被杀死