leetcode-candy
来源:互联网 发布:固守大数据 编辑:程序博客网 时间:2024/06/09 18:37
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?
解题思路:
1、从左到右扫描,如果右边比左边分数高,右边在左边糖果数基础上+1,否则糖果数为1
2、从右边到左扫描,如果左边分数比右边大,且左边糖果树不小于或等于右边糖果数,那么左边糖果数在右边糖果数基础上+1
3、最后求糖果数总和
public class Solution { public int candy(int[] ratings) { if(ratings.length==1) return 1; int[] candy=new int[ratings.length]; candy[0]=1;// for(int i=1;i<ratings.length;i++){ if(ratings[i-1]<ratings[i]){//如果右边比左边分数大,就糖果数加1 candy[i]=candy[i-1]+1; }else{ candy[i]=1;//否则糖果数为1 } } for(int i=ratings.length-2;i>=0;i--){ if(ratings[i]>ratings[i+1]&&candy[i]<=candy[i+1]){ candy[i]=candy[i+1]+1; } } int sum=0; for(int i=0;i<ratings.length;i++){ sum+=candy[i]; } return sum; } }
0 0
- 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
- [LeetCode] Candy
- ConcurrentHashMap
- Keras-数据集介绍
- PhpStorm 快捷键大全 PhpStorm 常用快捷键和配置
- PHP学习
- 帧动画功能 纯js控制css代码
- leetcode-candy
- JavaScript基础之对象
- java 使用URLConnection发送 http 请求
- Android开发之Handler
- Mysql学习总结(46)——8种常被忽视的SQL错误用法
- Access restriction: The type 'BASE64Encoder'
- C++中的namespace
- Shell基础
- 递归和循环