Added 2 solutions

varunu28 · varunu28 · commit 163624595164 · 2018-10-17T07:54:06.000-07:00
diff --git a/Easy/Read N characters Given Read4.java b/Easy/Read N characters Given Read4.java
@@ -0,0 +1,26 @@
+/* The read4 API is defined in the parent class Reader4.
+      int read4(char[] buf); */
+
+public class Solution extends Reader4 {
+    /**
+     * @param buf Destination buffer
+     * @param n   Maximum number of characters to read
+     * @return    The number of characters read
+     */
+    public int read(char[] buf, int n) {
+        int count = 0;
+        int total = 0;
+        int read = 4;
+        while(total <= n && read == 4){
+            char[] temp = new char[4];  
+            read = read4(temp); 
+            total += read;
+
+            for(int i = 0; i < read && count < n; i++) {
+                buf[count++] = temp[i];
+            }
+        }
+        
+        return count;
+    }
+}
diff --git a/Medium/Score of Parentheses.java b/Medium/Score of Parentheses.java
@@ -0,0 +1,25 @@
+class Solution {
+    public static int scoreOfParentheses(String S) {
+        Stack<String> st = new Stack<>();
+        for (int i=0; i<S.length(); i++) {
+            if (S.charAt(i) == '(') {
+                st.push(String.valueOf(S.charAt(i)));
+            }
+            else {
+                int num = 0;
+                while (!st.peek().equals("(")) {
+                    num += Integer.parseInt(st.pop());
+                }
+                st.pop();
+                st.push(num == 0 ? String.valueOf("1") : String.valueOf(2*num));
+            }
+        }
+
+        int ans = 0;
+        while (!st.empty()) {
+            ans += Integer.parseInt(st.pop());
+        }
+
+        return ans;
+    }
+}
