Added java program for Stack problem Design a Stack with Increment operation.

[Shamoyeeta]

Pull Request Template

Description

Design a stack which supports the following operations.
Implement the CustomStack class:
CustomStack(int maxSize) Initializes the object with maxSize which is the maximum number of elements in the stack or do nothing if the stack reached the maxSize.
void push(int x) Adds x to the top of the stack if the stack hasn't reached the maxSize.
int pop() Pops and returns the top of 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, just increment all the elements in the stack.

Code Explanation:
First a stack is created with a top element and then it is initialized in the constructor. The push() and pop() functions are implemented accordingly and the increment function implements the first k elements by given value.

Issue #90

Put check marks:

Have you made changes in README file ?

• Added problem & solution under correct topic.
• Specified Space & Time complexity.
• Specified difficulty level, tag & Note(if any).

How Has This Been Tested?

Please describe the tests that you ran to verify your changes. Please also note any relevant details for your test configuration.

• ["CustomStack","push","push","pop","push","push","push","increment","increment","pop","pop","pop","pop"]
  [[3],[1],[2],[],[2],[3],[4],[5,100],[2,100],[],[],[],[]]

Make sure all below guidelines are followed else PR will get Reject:

• My code follows the style guidelines of this project
• I have performed a self-review of my own code
• I have commented my code so that it is easy to understand
• I have made corresponding changes to the documentation
• My changes generate no new warnings
• Any dependent changes have been merged and published in downstream modules

[GouravRusiya30]

Time complexity will be O(n) right @Shamoyeeta

[Shamoyeeta]

Yes, sorry, my mistake. Fixed it!