leetcode题目:Candy

题目:

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

You are giving candies to these children subjected to the following requirements:

  • Each child must have at least one candy.
  • Children with a higher rating get more candies than their neighbors.

What is the minimum candies you must give?

代码:

class Solution {
public:
    int candy(vector<int> &ratings) {
        int size = ratings.size();
        vector<int>m_vec(size);
        int inivalue =1;
        for(int i = 1;i<size;i++)
        {
            if(ratings[i]>ratings[i-1])
            {
                m_vec[i] = inivalue++;
            }
            else
            {
                inivalue = 1;
            }
        }
        inivalue = 1;
        for(int j = size-2;j>=0;j--)
        {
            if(ratings[j]>ratings[j+1])
            {
                m_vec[j] = max(inivalue++,m_vec[j]);
            }
            else
            {
                inivalue = 1;
            }
        }
        return accumulate(m_vec.begin(),m_vec.end(),size);
    }
};


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值