leetcode pascal triangle recursion dp

dhananjay-ng · Dhananjay Nagargoje · commit 5dff5167f0b7 · 2019-11-06T14:18:59.000+05:30
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
diff --git a/src/main/java/problems/onRecursionAndDp/ArraySumPreviousElements.java b/src/main/java/problems/onRecursionAndDp/ArraySumPreviousElements.java
@@ -1,4 +1,4 @@
-package problems.onrecursion;
+package problems.onRecursionAndDp;
 
 import java.util.Arrays;
 
diff --git a/src/main/java/problems/onRecursionAndDp/CoinChange.java b/src/main/java/problems/onRecursionAndDp/CoinChange.java
@@ -1,4 +1,4 @@
-package problems.onrecursion;
+package problems.onRecursionAndDp;
 
 import java.util.Arrays;
 
diff --git a/src/main/java/problems/onRecursionAndDp/Factorial.java b/src/main/java/problems/onRecursionAndDp/Factorial.java
@@ -1,4 +1,4 @@
-package problems.onrecursion;
+package problems.onRecursionAndDp;
 
 public class Factorial {
     static int fact(int n) {
diff --git a/src/main/java/problems/onRecursionAndDp/HanoiTowers.java b/src/main/java/problems/onRecursionAndDp/HanoiTowers.java
@@ -1,4 +1,4 @@
-package problems.onrecursion;
+package problems.onRecursionAndDp;
 
 public class HanoiTowers {
     static void game(int n, char fromTower, char middleTower, char desitnationTower) {
diff --git a/src/main/java/problems/onRecursionAndDp/IsArraySorted.java b/src/main/java/problems/onRecursionAndDp/IsArraySorted.java
@@ -1,4 +1,4 @@
-package problems.onrecursion;
+package problems.onRecursionAndDp;
 
 public class IsArraySorted {
     static boolean isSorted(int[] A, int n) {
diff --git a/src/main/java/problems/onRecursionAndDp/PascalTriangle.java b/src/main/java/problems/onRecursionAndDp/PascalTriangle.java
@@ -0,0 +1,39 @@
+package problems.onRecursionAndDp;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
+public class PascalTriangle {
+    public List<List<Integer>> generate(int numRows) {
+        List<List<Integer>> res = new ArrayList<>();
+        int cache[][] = new int[numRows + 1][numRows + 1];
+
+        for (int i = 0; i < numRows + 1; i++) {
+            Arrays.fill(cache[i], -1);
+        }
+
+        for (int i = 1; i <= numRows; i++) {
+            List<Integer> row = new ArrayList<>();
+            for (int j = 1; j <= i; j++) {
+                row.add(getNumFromPascalTriangle(i, j, cache));
+            }
+            res.add(row);
+        }
+
+        return res;
+    }
+
+
+    public int getNumFromPascalTriangle(int i, int j, int[][] cache) {
+        if (j == 1 || i == j) return 1;
+        if (cache[i][j] == -1) {
+            int res = getNumFromPascalTriangle(i - 1, j - 1, cache)
+                    + getNumFromPascalTriangle(i - 1, j, cache);
+
+            cache[i][j] = res;
+        }
+
+        return cache[i][j];
+    }
+}
diff --git a/src/main/java/problems/onRecursionAndDp/StringPermutations.java b/src/main/java/problems/onRecursionAndDp/StringPermutations.java
@@ -1,4 +1,4 @@
-package problems.onrecursion;
+package problems.onRecursionAndDp;
 
 import java.io.*;
 import java.util.Arrays;
diff --git a/src/main/java/problems/onRecursionAndDp/SwapPairs.java b/src/main/java/problems/onRecursionAndDp/SwapPairs.java
@@ -1,4 +1,4 @@
-package problems.onlinkedlist;
+package problems.onRecursionAndDp;
 
 public class SwapPairs {
     /**
diff --git a/src/main/java/problems/test/test.in b/src/main/java/problems/test/test.in
@@ -0,0 +1 @@
+1 2
diff --git a/src/main/java/problems/test/test.java b/src/main/java/problems/test/test.java
@@ -0,0 +1,27 @@
+package problems.test;
+
+/* Use the slash-star style comments or the system won't see your
+   identification information */
+/*
+ID: dhanu101
+LANG: JAVA
+TASK: test
+*/
+import java.io.*;
+import java.util.*;
+
+public class test {
+    public static void main (String [] args) throws IOException {
+        // Use BufferedReader rather than RandomAccessFile; it's much faster
+        BufferedReader f = new BufferedReader(new FileReader("test.in"));
+        // input file name goes above
+        PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("test.out")));
+        // Use StringTokenizer vs. readLine/split -- lots faster
+        StringTokenizer st = new StringTokenizer(f.readLine());
+        // Get line, break into tokens
+        int i1 = Integer.parseInt(st.nextToken());    // first integer
+        int i2 = Integer.parseInt(st.nextToken());    // second integer
+        out.println(i1+i2);                           // output result
+        out.close();                                  // close the output file
+    }
+}
diff --git a/src/main/java/problems/test/test.out b/src/main/java/problems/test/test.out
@@ -0,0 +1 @@
+3

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package problems.onrecursion;`
	`1`	`+package problems.onRecursionAndDp;`
`2`	`2`
`3`	`3`	`import java.util.Arrays;`
`4`	`4`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package problems.onlinkedlist;`
	`1`	`+package problems.onRecursionAndDp;`
`2`	`2`
`3`	`3`	`public class SwapPairs {`
`4`	`4`	`/**`