Commit284ad4f

committed

refactor 856

1 parentb50e5df commit284ad4fCopy full SHA for 284ad4f

File tree

+23

-3

lines changed

src
- main/java/com/fishercoder/solutions
  - _856.java
- test/java/com/fishercoder
  - _856Test.java

+23

-3

lines changed

Lines changed: 23 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,10 +1,31 @@`
`1`	`1`	`packagecom.fishercoder.solutions;`
`2`	`2`
	`3`	`+importjava.util.Stack;`
	`4`	`+`
`3`	`5`	`publicclass_856 {`
`4`	`6`	`publicstaticclassSolution1 {`
`5`		`-//TODO: implement it`
	`7`	`+/**`
	`8`	`+ * credit: https://leetcode.com/problems/score-of-parentheses/discuss/141763/Java-solution-using-Stack`
	`9`	`+ */`
`6`	`10`	`publicintscoreOfParentheses(StringS) {`
`7`		`-return -1;`
	`11`	`+Stack<Integer>stack =newStack<>();`
	`12`	`+for (inti =0;i <S.length();i++) {`
	`13`	`+if (S.charAt(i) =='(') {`
	`14`	`+stack.push(-1);`
	`15`	`+ }else {`
	`16`	`+intcurr =0;`
	`17`	`+while (stack.peek() != -1) {`
	`18`	`+curr +=stack.pop();`
	`19`	`+ }`
	`20`	`+stack.pop();`
	`21`	`+stack.push(curr ==0 ?1 :curr *2);`
	`22`	`+ }`
	`23`	`+ }`
	`24`	`+intscore =0;`
	`25`	`+while (!stack.isEmpty()) {`
	`26`	`+score +=stack.pop();`
	`27`	`+ }`
	`28`	`+returnscore;`
`8`	`29`	`}`
`9`	`30`	`}`
`10`	`31`	`}`

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -7,7 +7,6 @@`
`7`	`7`
`8`	`8`	`importstaticorg.junit.Assert.assertEquals;`
`9`	`9`
`10`		`-@Ignore`
`11`	`10`	`publicclass_856Test {`
`12`	`11`	`privatestatic_856.Solution1solution1;`
`13`	`12`

Comments

(0)