[LeetCode]Candy
来源:互联网 发布:php 异步请求类 编辑:程序博客网 时间:2024/06/11 21:05
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?
Analysis:
the value of candy[i] depends on its left and right node. the idea comes from here, we can scan from two sides
Scan the rating array from left to right and then from right to left. In every scan just consider the rising order (l->r: r[i]>r[i-1] or r->l: r[i]>r[i+1]), assign +1 candies to the rising position.
The final candy array is the maximum (max(right[i],left[i])) in each position.
The total candies is the sum of the final candy array.
java
public int candy(int[] ratings) {int len = ratings.length;if(len<=0) return 0;if(len==1) return 1;int result = 0;int []lr = new int[len];int []rl = new int[len];lr[0] = 1;rl[len-1] = 1;for(int i=1;i<len;i++){//from left to rightif(ratings[i]>ratings[i-1])lr[i] = lr[i-1]+1;else {lr[i] = 1;}}for(int i=len-2;i>=0;i--){if(ratings[i]>ratings[i+1])rl[i] = rl[i+1]+1;elserl[i] = 1;}for(int i=0;i<len;i++){result+=Math.max(lr[i], rl[i]);}return result; }c++
int candy(vector<int> &ratings) { int result =0; vector<int> lc(ratings.size(),1); vector<int> rc(ratings.size(),1); for(int i=1;i<ratings.size();i++){ if(ratings[i]>ratings[i-1]) lc[i] = lc[i-1]+1; } for(int i=ratings.size()-2;i>=0;i--){ if(ratings[i]>ratings[i+1]) rc[i] = rc[i+1]+1; } for(int i=0;i<ratings.size();i++){ result+=max(lc[i],rc[i]); } return result; }
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
- IOS_加速计_CoreMotion框架_单例_时钟_Get+异步请求+Json
- JavaScript学习第一弹:【图片轮播实现】
- lua源码注释1【转】
- freemarker报错之八
- 面向对象-Object类
- [LeetCode]Candy
- 机器学习--学习笔记(四)--支持向量机
- C语言文件读写命令
- Win 8 系统下 Weblogic server 12c 的下载安装与配置——Windows J2EE开发安装序列之六
- BaiduMap_SDK_DEMO_3.0.0_for_Xamarin.Android_by_imknown
- lua和C++相互交换数据1 【转】
- freemarker报错之九
- codeblocks使用gtk遇到“undefined reference to:gdk_pixbuf_new_from_file”
- 【转载】Deep Learning in NLP (一)词向量和语言模型