LeetCode119-杨辉三角||

class Solution {
    public List<Integer> getRow(int rowIndex) {
       if(rowIndex == 0){
           List<Integer> list = new ArrayList<Integer>();
           list.add(1);
           return list;
       }
       if(rowIndex == 1){
           List<Integer> list = new ArrayList<Integer>();
           list.add(1);
           list.add(1);
           return list;
       }
       int[] pre = {1,1};
       int i = 2;
       while(i <= rowIndex){
           int[] now = new int[i+1];
           now[0] = 1;
           now[i] = 1;
           for(int j = 1; j < i  ;j++)
           {
              now[j] = pre[j-1] + pre[j];
           }
           pre = now;
           i += 1;
       } 
       List<Integer> list = new ArrayList<Integer>();
       for(int j = 0;j < pre.length;j++)
           list.add(pre[j]);
       return list;
    }
}