Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit034d951

Browse files
Add C++ implementation
Signed-off-by: begeekmyfriend <begeekmyfriend@gmail.com>
1 parente7da092 commit034d951

File tree

2 files changed

+29
-3
lines changed

2 files changed

+29
-3
lines changed

‎0135_candy/candy.c‎

Lines changed: 5 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,10 +1,12 @@
11
#include<stdio.h>
22
#include<stdlib.h>
33

4-
staticintcandy(int*ratings,intratingsSize)
4+
5+
intcandy(int*ratings,intratingsSize)
56
{
6-
if (ratingsSize==0)return0;
7-
if (ratingsSize==1)return1;
7+
if (ratingsSize==0) {
8+
return0;
9+
}
810

911
inti,*candies=malloc(ratingsSize*sizeof(int));
1012
candies[0]=1;

‎0135_candy/candy.cc‎

Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
#include<bits/stdc++.h>
2+
3+
usingnamespacestd;
4+
5+
classSolution {
6+
public:
7+
intcandy(vector<int>& ratings) {
8+
vector<int>candies(ratings.size(),1);
9+
for (int i =1; i < ratings.size(); i++) {
10+
if (ratings[i] > ratings[i -1]) {
11+
candies[i] = candies[i -1] +1;
12+
}
13+
}
14+
15+
int sum = candies[ratings.size() -1];
16+
for (int i = ratings.size() -2; i >=0; i--) {
17+
if (ratings[i] > ratings[i +1] && candies[i] <= candies[i +1]) {
18+
candies[i] = candies[i +1] +1;
19+
}
20+
sum += candies[i];
21+
}
22+
return sum;
23+
}
24+
};

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp