anxious-coder-lhs
diff --git a/‎slides/dynamicprogramming/tiling_dominoes.key
35.3 KB b/‎slides/dynamicprogramming/tiling_dominoes.key
35.3 KB
diff --git a/‎src/main/java/com/williamfiset/algorithms/dp/examples/domino-and-tromino-tiling/Solution.java
Lines changed: 7 additions & 0 deletions b/‎src/main/java/com/williamfiset/algorithms/dp/examples/domino-and-tromino-tiling/Solution.java
Lines changed: 7 additions & 0 deletions
@@ -85,4 +85,11 @@ static int makeState(boolean row1, boolean row2) {
     if (row2) state |= 0b10;
     return state;
   }
+
+  public static void main(String[] args) {
+    Solution s = new Solution();
+    for (int n = 1; n <= 10; n++) {
+      System.out.printf("n = %d, ans = %d\n", n, s.numTilings(n));
+    }
+  }
 }
Original file line number	Diff line number	Diff line change
`@@ -85,4 +85,11 @@ static int makeState(boolean row1, boolean row2) {`
`85`	`85`	`if (row2) state \|= 0b10;`
`86`	`86`	`return state;`
`87`	`87`	`}`
	`88`	`+`
	`89`	`+ public static void main(String[] args) {`
	`90`	`+ Solution s = new Solution();`
	`91`	`+ for (int n = 1; n <= 10; n++) {`
	`92`	`+ System.out.printf("n = %d, ans = %d\n", n, s.numTilings(n));`
	`93`	`+ }`
	`94`	`+ }`
`88`	`95`	`}`