Add solution #1381

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,265 LeetCode solutions in JavaScript
+# 1,266 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1052,6 +1052,7 @@
 1377|[Frog Position After T Seconds](./solutions/1377-frog-position-after-t-seconds.js)|Hard|
 1379|[Find a Corresponding Node of a Binary Tree in a Clone of That Tree](./solutions/1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.js)|Easy|
 1380|[Lucky Numbers in a Matrix](./solutions/1380-lucky-numbers-in-a-matrix.js)|Easy|
+1381|[Design a Stack With Increment Operation](./solutions/1381-design-a-stack-with-increment-operation.js)|Medium|
 1389|[Create Target Array in the Given Order](./solutions/1389-create-target-array-in-the-given-order.js)|Easy|
 1400|[Construct K Palindrome Strings](./solutions/1400-construct-k-palindrome-strings.js)|Medium|
 1402|[Reducing Dishes](./solutions/1402-reducing-dishes.js)|Hard|

solutions/1381-design-a-stack-with-increment-operation.js

@@ -0,0 +1,52 @@
+/**
+ * 1381. Design a Stack With Increment Operation
+ * https://leetcode.com/problems/design-a-stack-with-increment-operation/
+ * Difficulty: Medium
+ *
+ * Design a stack that supports increment operations on its elements.
+ *
+ * Implement the CustomStack class:
+ * - CustomStack(int maxSize) Initializes the object with maxSize which is the maximum number
+ *   of elements in the stack.
+ * - void push(int x) Adds x to the top of the stack if the stack has not reached the maxSize.
+ * - int pop() Pops and returns the top of the stack or -1 if the stack is empty.
+ * - void inc(int k, int val) Increments the bottom k elements of the stack by val. If there are
+ *   less than k elements in the stack, increment all the elements in the stack.
+ */
+
+/**
+ * @param {number} maxSize
+ */
+var CustomStack = function(maxSize) {
+  this.elements = [];
+  this.capacity = maxSize;
+};
+
+/**
+ * @param {number} x
+ * @return {void}
+ */
+CustomStack.prototype.push = function(x) {
+  if (this.elements.length < this.capacity) {
+    this.elements.push(x);
+  }
+};
+
+/**
+ * @return {number}
+ */
+CustomStack.prototype.pop = function() {
+  return this.elements.length ? this.elements.pop() : -1;
+};
+
+/**
+ * @param {number} k
+ * @param {number} val
+ * @return {void}
+ */
+CustomStack.prototype.increment = function(k, val) {
+  const limit = Math.min(k, this.elements.length);
+  for (let i = 0; i < limit; i++) {
+    this.elements[i] += val;
+  }
+};