import java.util.*;
public class Solution {
/**
* pick candy
* @param arr int整型一维数组 the array
* @return int整型
*/
public int candy (int[] arr) {
// write code here
if(arr.length <= 1)
return arr.length;
int[] s = new int[arr.length];
Arrays.fill(s, 1);
for(int i = 1; i < arr.length; i++){
if(arr[i] > arr[i - 1]){
s[i] = s[i - 1] + 1;
}
}
for(int i = arr.length - 2; i >= 0; i--){
if(arr[i] > arr[i + 1] && s[i] <= s[i + 1]){
s[i] = s[i + 1] + 1;
}
}
int res = 0;
for(int i = 0; i < arr.length; i++){
res += s[i];
}
return res;
}
}
牛客-TOP101-BM95
最新推荐文章于 2024-07-23 20:38:48 发布