zoukankan      html  css  js  c++  java
  • candy leetcode C++

    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?

    C++

    class Solution {
    public:
        int candy(vector<int> &ratings) {
            int len=ratings.size();
            if(len==1) return 1;
            int sum=0;
            vector<int> v(len,1);
            for(int i=1;i<len;i++){
                if(ratings[i] > ratings[i-1])
                    v[i]=v[i-1]+1;
            }
            for(int i=len-2;i>=0;i--){
                if(ratings[i] > ratings[i+1] && v[i] <= v[i+1])
                    v[i]=v[i+1]+1;
            }
            for(int i=0;i<len;i++){
                sum+=v[i];
            }
            return sum;
        }
    };
  • 相关阅读:
    c++类中比较重要的几个函数
    rosbag使用方法
    2.urllib库的使用
    什么叫做API?
    1.爬虫基础
    正则表达式

    time模块
    random模块
    日志处理
  • 原文地址:https://www.cnblogs.com/vercont/p/10210288.html
Copyright © 2011-2022 走看看