LeetCode-Pascal's Triangle

菜鸟刷的第一题LeetCode，毫无任何优化，虽然是一道easy的题目，看到Accepted心里还是甚是欣慰的。

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Solution {
    public List<List<Integer>> generate(int numRows) {
        List<List<Integer>> pascal = new ArrayList<List<Integer>>();
        for (int i = 0; i < numRows; i++) {
            List<Integer> list = new ArrayList<Integer>();
            for (int j = 0; j < i+1; j++) {
                if(i==0 ||i == 1)
                {
                    list.add(1);
                }
                else
                {
                    if(j==0||j==i)
                    {
                        list.add(1);
                    }
                    else
                    {
                        list.add(pascal.get(i-1).get(j-1)+pascal.get(i-1).get(j));
                    }
                }
            }
        pascal.add(list);
        //list.clear();
        }
        return pascal;
        
    }
    public static void main(String args[])
    {
        Solution sl = new Solution();
        Scanner sc = new Scanner(System.in); 
        int n = sc.nextInt();
        List<List<Integer>> pascal = sl.generate(n);
        for(int i = 0;i<n;i++)
        {
            System.out.println(pascal.get(i));
        }
    }
}