首页 > 代码库 > 118. Pascal's Triangle
118. Pascal's Triangle
118. Pascal‘s Triangle
Given numRows, generate the first numRows of Pascal‘s triangle.
For example, given numRows = 5,
Return
[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ]
public class Solution { /* public List<List<Integer>> generate(int numRows) { List<List<Integer>> res = new ArrayList<>(); if(numRows == 0) return res; List<Integer> member = new ArrayList<>(); member.add(1); res.add(member); if(numRows == 0) return res; for(int i = 1; i< numRows ; i++){ List<Integer> newMember = new ArrayList<>(); newMember.add(1); for(int j = 0; j < member.size() -1; j ++){ newMember.add(member.get(j) + member.get(j+1)); } newMember.add(1); res.add(newMember); member = newMember; } return res; } */ // better way // set(int index, E element) Replaces the element at the specified position in this list with the specified element (optional operation). public List<List<Integer>> generate(int numRows) { List<List<Integer>> res = new ArrayList<>(); if(numRows == 0) return res; List<Integer> member = new ArrayList<>(); for(int i = 0; i< numRows ; i++){ member.add(0,1); //每次在首度加1 for(int j = 1 ; j < member.size() -1 ; j++){ member.set(j, member.get(j) + member.get(j +1)); } System.out.println(member); res.add(new ArrayList<Integer> (member)); } return res; } }
118. Pascal's Triangle
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。