add one more solution for 118 and test

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_118.java

@@ -22,6 +22,7 @@
 public class _118 {
 
   public static class Solution1 {
+    /**fill out values from left to right*/
     public List<List<Integer>> generate(int numRows) {
       List<List<Integer>> result = new ArrayList();
       List<Integer> row = new ArrayList();
@@ -35,4 +36,21 @@ public List<List<Integer>> generate(int numRows) {
       return result;
     }
   }
+
+  public static class Solution2 {
+    /**fill out values from right to left
+     * credit: https://leetcode.com/problems/pascals-triangle/discuss/38141/My-concise-solution-in-Java/36127*/
+    public List<List<Integer>> generate(int numRows) {
+      List<List<Integer>> result = new ArrayList();
+      List<Integer> row = new ArrayList();
+      for (int i = 0; i < numRows; i++) {
+        for (int j = row.size() - 1; j >= 1; j--) {
+          row.set(j, row.get(j) + row.get(j - 1));
+        }
+        row.add(1);
+        result.add(new ArrayList(row));
+      }
+      return result;
+    }
+  }
 }

src/test/java/com/fishercoder/_118Test.java

@@ -0,0 +1,24 @@
+package com.fishercoder;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions._118;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+public class _118Test {
+    private static _118.Solution1 solution1;
+    private static _118.Solution2 solution2;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _118.Solution1();
+        solution2 = new _118.Solution2();
+    }
+
+    @Test
+    public void test1() {
+        CommonUtils.printListList(solution1.generate(5));
+        CommonUtils.printListList(solution2.generate(5));
+    }
+
+}