refactor 856

fishercoder1534 · fishercoder1534 · commit bf0695d700db · 2020-07-25T06:40:13.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/Contest.java b/src/main/java/com/fishercoder/solutions/Contest.java
@@ -0,0 +1,11 @@
+package com.fishercoder.solutions;
+
+public class Contest {
+
+
+    public static void main(String... args) {
+        Contest contest = new Contest();
+        System.out.println(contest);
+        System.out.println("Finished.");
+    }
+}
diff --git a/src/main/java/com/fishercoder/solutions/_856.java b/src/main/java/com/fishercoder/solutions/_856.java
@@ -1,37 +1,8 @@
 package com.fishercoder.solutions;
 
-import java.util.Stack;
-
-/**
- * 856. Score of Parentheses
- *
- * Given a balanced parentheses string S, compute the score of the string based on the following rule:
- * () has score 1
- * AB has score A + B, where A and B are balanced parentheses strings.
- * (A) has score 2 * A, where A is a balanced parentheses string.
- *
- * Example 1:
- * Input: "()"
- * Output: 1
- *
- * Example 2:
- * Input: "(())"
- * Output: 2
- *
- * Example 3:
- * Input: "()()"
- * Output: 2
- *
- * Example 4:
- * Input: "(()(()))"
- * Output: 6
- *
- * Note:
- * S is a balanced parentheses string, containing only ( and ).
- * 2 <= S.length <= 50
- * */
 public class _856 {
     public static class Solution1 {
+        //TODO: implement it
         public int scoreOfParentheses(String S) {
             return -1;
         }
