Time: 0 ms (100%), Space: 22.8 MB (59.49%) - LeetHub

Author: MishkatIT

0135-candy/0135-candy.cpp

@@ -0,0 +1,20 @@
+class Solution {
+public:
+    int candy(vector<int>& v) {
+        int n = v.size();
+        vector<int> ans(n, 1);
+        for (int i = 1; i < n; i++) {
+           if (v[i] > v[i - 1]) {
+             ans[i] = max(ans[i], ans[i - 1] + 1);
+           }
+        }
+        for (int i = n - 2; i >= 0; i--) {
+            if (v[i] > v[i + 1]) {
+                ans[i] = max(ans[i], ans[i + 1] + 1);
+            }
+        }
+        int cnt = 0;
+        for (auto& i : ans) cnt += i;
+        return cnt;
+    }
+};