Commit46ea5b9

authored

added array solution for 1381 with test cases (#127)

1 parentc25b0fb commit46ea5b9Copy full SHA for 46ea5b9

File tree

+55

-0

lines changed

src
- main/java/com/fishercoder/solutions
  - _1381.java
- test/java/com/fishercoder
  - _1381Test.java

+55

-0

lines changed

Lines changed: 39 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -79,4 +79,43 @@ public void increment(int k, int val) {`
`79`	`79`	`}`
`80`	`80`	`}`
`81`	`81`	`}`
	`82`	`+`
	`83`	`+/**`
	`84`	`+ * Implementation of Stack using Array`
	`85`	`+ */`
	`86`	`+publicstaticclassSolution2{`
	`87`	`+publicstaticclassCustomStack {`
	`88`	`+privateinttop;`
	`89`	`+privateintmaxSize;`
	`90`	`+privateintstack[];`
	`91`	`+publicCustomStack(intmaxSize) {`
	`92`	`+this.maxSize =maxSize;`
	`93`	`+this.stack =newint[maxSize];`
	`94`	`+ }`
	`95`	`+`
	`96`	`+publicvoidpush(intx) {`
	`97`	`+if(top ==maxSize)return;`
	`98`	`+stack[top] =x;`
	`99`	`+top++;`
	`100`	`+ }`
	`101`	`+`
	`102`	`+publicintpop() {`
	`103`	`+if(top ==0)`
	`104`	`+return -1;`
	`105`	`+intpopValue =stack[top-1];`
	`106`	`+stack[top-1] =0;`
	`107`	`+top--;`
	`108`	`+returnpopValue;`
	`109`	`+ }`
	`110`	`+`
	`111`	`+publicvoidincrement(intk,intval) {`
	`112`	`+if(top ==0 \|\|k ==0)return;`
	`113`	`+for(inti =0;i<k;i++){`
	`114`	`+if(i ==top)`
	`115`	`+break;`
	`116`	`+stack[i] +=val;`
	`117`	`+ }`
	`118`	`+ }`
	`119`	`+ }`
	`120`	`+ }`
`82`	`121`	`}`

Lines changed: 16 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -7,6 +7,7 @@`
`7`	`7`
`8`	`8`	`publicclass_1381Test {`
`9`	`9`	`privatestatic_1381.Solution1.CustomStackcustomStack;`
	`10`	`+privatestatic_1381.Solution2.CustomStackcustomStack2;`
`10`	`11`
`11`	`12`	`@Test`
`12`	`13`	`publicvoidtest1() {`
`@@ -24,5 +25,20 @@ public void test1() {`
`24`	`25`	`assertEquals(201,customStack.pop());`
`25`	`26`	`assertEquals(-1,customStack.pop());`
`26`	`27`	`}`
	`28`	`+@Test`
	`29`	`+publicvoidtest2() {`
	`30`	`+customStack2 =new_1381.Solution2.CustomStack(3);`
	`31`	`+customStack2.push(-1);`
	`32`	`+customStack2.push(20);`
	`33`	`+assertEquals(20,customStack2.pop());`
	`34`	`+customStack2.push(30);`
	`35`	`+customStack2.push(40);`
	`36`	`+customStack2.push(50);`
	`37`	`+customStack2.increment(5,100);`
	`38`	`+assertEquals(140,customStack2.pop());`
	`39`	`+assertEquals(130,customStack2.pop());`
	`40`	`+assertEquals(99,customStack2.pop());`
	`41`	`+`
	`42`	`+ }`
`27`	`43`
`28`	`44`	`}`

Comments

(0)