이슈 #452에서 솔루션 추가

fkdl0048 · Feb 12, 2025 · 8dab5e2 · 8dab5e2
1 parent 90508c5
commit 8dab5e2
Showing 1 changed file with 25 additions and 0 deletions.
diff --git a/LeetCode/Candy.cpp b/LeetCode/Candy.cpp
@@ -0,0 +1,25 @@
+class Solution {
+public:
+    int candy(vector<int>& ratings) {
+        int n = ratings.size();
+
+        vector<int> candies(n, 1);
+
+        for (int i = 1; i < n; i++) {
+            if (ratings[i] > ratings[i - 1])
+                candies[i] = candies[i - 1] + 1;
+        }
+
+        for (int i = n - 2; i >= 0; i--) {
+            if (ratings[i] > ratings[i + 1])
+                candies[i] = max(candies[i], candies[i + 1] + 1);
+        }
+
+        int totalCandies = 0;
+        for (int candy : candies) {
+            totalCandies += candy;
+        }
+
+        return totalCandies;
+    }
+};