leetcode easy - Pascal's Triangle

LeetCode

https://leetcode.com/problems/pascals-triangle/

Code

import java.util.ArrayList;

import java.util.List;

class Solution {

    public List<List<Integer>> generate(int numRows) {

        List<List<Integer>> result = new ArrayList<>();

        for ( int i = 0; i < numRows; i++ ) {

            List<Integer> row = new ArrayList<>();

            for ( int j = 0; j <= i; j++ ) {

                if (i == 0 || i == 1 || j == 0 || i == j) {

                    row.add(1);

                    continue;

                }

                System.out.println("(" + i + "," + j + ")");

                row.add(result.get(i-1).get(j-1) + result.get(i-1).get(j));

            }

            result.add(row);

        }

        return result;

    }

}