Candy
来源:互联网 发布:淘宝赚佣金方法 编辑:程序博客网 时间:2024/06/15 08:54
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: # @param ratings, a list of integer # @return an integer def candy(self, ratings): mark = [1 for i in range(len(ratings))] # left to right i=1 while i < len(mark): if ratings[i] > ratings[i-1]: mark[i]=mark[i-1]+1 i=i+1 #right to left i=len(mark)-2 while i>=0: if ratings[i] > ratings[i+1]: mark[i]=max(mark[i+1]+1,mark[i]) i=i-1 return sum(mark)
0 0
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- candy
- Candy
- Candy
- Candy
- Candy
- 汇编语言学习知识点1
- Android NDK环境搭建和开发入门
- 泛型——定义泛型类(接口)、class文件、instanceof操作符
- nginx介绍(三) 配置篇
- oracle 的to_number、to_char、to_date用法
- Candy
- [Cocoa]XCode的一些调试技巧
- Android中的文件存储技术
- 使用命令行对 ARM DS5 的工程进行编译
- Yii将需要的log写入到数据库中 (重新CDbLogRoute)
- 详解window.location
- nginx介绍(四) 经验篇
- java树状结构之二叉树
- iOS7与iOS8的比较