modify code

Author: algorithmzuo

src/class098/Code02_FibonacciNumber.java

@@ -31,7 +31,10 @@ public static int fib2(int n) {
 		if (n == 1) {
 			return 1;
 		}
-		int[][] base = { { 1, 1 }, { 1, 0 } };
+		int[][] base = {
+				{ 1, 1 },
+				{ 1, 0 }
+				};
 		int[][] m = power(base, n - 1);
 		return m[0][0];
 	}

src/class098/Code03_ClimbingStairs.java

@@ -17,7 +17,10 @@ public static int climbStairs(int n) {
 		if (n == 1) {
 			return 1;
 		}
-		int[][] base = { { 1, 1 }, { 1, 0 } };
+		int[][] base = {
+				{ 1, 1 },
+				{ 1, 0 }
+				};
 		int[][] m = power(base, n - 1);
 		return m[0][0] + m[1][0];
 	}

src/class098/Code04_TribonacciNumber.java

@@ -19,7 +19,11 @@ public static int tribonacci(int n) {
 		if (n == 2) {
 			return 1;
 		}
-		int[][] base = { { 1, 1, 0 }, { 1, 0, 1 }, { 1, 0, 0 } };
+		int[][] base = {
+				{ 1, 1, 0 },
+				{ 1, 0, 1 },
+				{ 1, 0, 0 }
+				};
 		int[][] m = power(base, n - 2);
 		return m[0][0] + m[1][0];
 	}

src/class098/Code05_DominoTromino.java

@@ -54,7 +54,11 @@ public static int f2(int n) {
 		if (n == 2) {
 			return 5;
 		}
-		int[][] base = { { 2, 1, 0 }, { 0, 0, 1 }, { 1, 0, 0 } };
+		int[][] base = {
+				{ 2, 1, 0 },
+				{ 0, 0, 1 },
+				{ 1, 0, 0 }
+				};
 		int[][] m = power(base, n - 2);
 		long ans = 5L * m[0][0] % MOD;
 		ans = (ans + 2L * m[1][0]) % MOD;