added GenerateParentheses.java

Dipanjansur · May 29, 2018 · 0adbc0d · 0adbc0d
1 parent 7920d94
commit 0adbc0d
Show file tree

Hide file tree

Showing 4 changed files with 92 additions and 0 deletions.
diff --git a/company/google/GenerateParentheses.java b/company/google/GenerateParentheses.java
@@ -0,0 +1,23 @@
+class GenerateParentheses {
+    public List<String> generateParenthesis(int n) {
+        List<String> result = new ArrayList<String>();
+        generateParenthesisRecursive(result, "", 0, 0, n);
+
+        return result;
+    }
+
+    public void generateParenthesisRecursive(List<String> result, String current, int open, int close, int n) {
+        if(current.length() == n * 2) {
+            result.add(current);
+            return;
+        }
+
+        if(open < n) {
+            generateParenthesisRecursive(result, current + "(", open + 1, close, n);
+        }
+
+        if(close < open) {
+            generateParenthesisRecursive(result, current + ")", open, close + 1, n);
+        }
+    }
+}
diff --git a/company/uber/GenerateParentheses.java b/company/uber/GenerateParentheses.java
@@ -0,0 +1,23 @@
+class GenerateParentheses {
+    public List<String> generateParenthesis(int n) {
+        List<String> result = new ArrayList<String>();
+        generateParenthesisRecursive(result, "", 0, 0, n);
+
+        return result;
+    }
+
+    public void generateParenthesisRecursive(List<String> result, String current, int open, int close, int n) {
+        if(current.length() == n * 2) {
+            result.add(current);
+            return;
+        }
+
+        if(open < n) {
+            generateParenthesisRecursive(result, current + "(", open + 1, close, n);
+        }
+
+        if(close < open) {
+            generateParenthesisRecursive(result, current + ")", open, close + 1, n);
+        }
+    }
+}
diff --git a/leetcode/backtracking/GenerateParentheses.java b/leetcode/backtracking/GenerateParentheses.java
@@ -0,0 +1,23 @@
+class GenerateParentheses {
+    public List<String> generateParenthesis(int n) {
+        List<String> result = new ArrayList<String>();
+        generateParenthesisRecursive(result, "", 0, 0, n);
+
+        return result;
+    }
+
+    public void generateParenthesisRecursive(List<String> result, String current, int open, int close, int n) {
+        if(current.length() == n * 2) {
+            result.add(current);
+            return;
+        }
+
+        if(open < n) {
+            generateParenthesisRecursive(result, current + "(", open + 1, close, n);
+        }
+
+        if(close < open) {
+            generateParenthesisRecursive(result, current + ")", open, close + 1, n);
+        }
+    }
+}
diff --git a/leetcode/string/GenerateParentheses.java b/leetcode/string/GenerateParentheses.java
@@ -0,0 +1,23 @@
+class GenerateParentheses {
+    public List<String> generateParenthesis(int n) {
+        List<String> result = new ArrayList<String>();
+        generateParenthesisRecursive(result, "", 0, 0, n);
+
+        return result;
+    }
+
+    public void generateParenthesisRecursive(List<String> result, String current, int open, int close, int n) {
+        if(current.length() == n * 2) {
+            result.add(current);
+            return;
+        }
+
+        if(open < n) {
+            generateParenthesisRecursive(result, current + "(", open + 1, close, n);
+        }
+
+        if(close < open) {
+            generateParenthesisRecursive(result, current + ")", open, close + 1, n);
+        }
+    }
+}