-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcandy.c
43 lines (37 loc) · 977 Bytes
/
candy.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int candy(int* ratings, int ratingsSize){
int candy[ratingsSize];
memset(candy, 1, sizeof(candy));
for(int i = 0; i < ratingsSize; i++){
//sum += candy[i];
printf("candy is %d\n",candy[i]);
}
for(int i = 1; i < ratingsSize; i++){
if(ratings[i] > ratings[i - 1]){
candy[i] = candy[i - 1] + 1;
}
}
for(int i = ratingsSize -2; i >= 0; i--){
if(ratings[i] > ratings[i + 1]){
candy[i] = (candy[i + 1] + 1) > candy[i] ? (candy[i + 1] + 1) : candy[i];
}
}
int sum = 0;
for(int i = 0; i < ratingsSize; i++){
sum += candy[i];
printf("candy is %d\n",candy[i]);
}
return sum;
}
int main(){
int b[3] = {0};
memset(b,2,sizeof(b));
for(int i = 0; i < 3; i++){
//sum += candy[i];
printf("b is %d\n",b[i]);
}
int a[3] ={1,0,2};
printf("result is %d\n",candy(a,3));
}