Runtime: 35 ms (Top 95.05%) | Memory: 21.1 MB (Top 38.81%)

Author: AnasImloul

scripts/algorithms/D/Design a Stack With Increment Operation/Design a Stack With Increment Operation.cpp

@@ -1,3 +1,4 @@
+// Runtime: 35 ms (Top 95.05%) | Memory: 21.1 MB (Top 38.81%)
 class CustomStack {
     int *data;
     int nextIndex;
@@ -8,15 +9,15 @@ class CustomStack {
         nextIndex = 0;
         capacity = maxSize;
     }
-    
+
     void push(int x) {
         if(nextIndex == capacity){
             return;
         }
         data[nextIndex] = x;
         nextIndex++;
     }
-    
+
     int pop() {
         if(nextIndex == 0){
             return -1;
@@ -25,12 +26,12 @@ class CustomStack {
         nextIndex--;
         return temp;
     }
-    
+
     void increment(int k, int val) {
-		//loop will run upto nextIndex if k >= nextIndex else runt upto k only
+        //loop will run upto nextIndex if k >= nextIndex else runt upto k only
         int n = (k >= nextIndex) ? nextIndex : k;
         for(int i = 0; i < n; i++){
-            data[i]  = data[i] + val;
+            data[i] = data[i] + val;
         }
     }
-};
+};