LeetCode Pascal's Triangle II

Description:

Given an index k, return the kth row of the Pascal's triangle.

For example, given k = 3,
Return [1,3,3,1].

Solution:

和Pascal's Triangle没区别。

import java.util.*;

public class Solution {
	 public List<Integer> getRow(int rowIndex) {
		LinkedList<Integer> array = new LinkedList<Integer>();
		LinkedList<Integer> neoArray = new LinkedList<Integer>();

		array.add(1);
		if (rowIndex == 0)
			return array;

		array.add(1);
		if (rowIndex == 1)
			return array;

		int pre, cur;

		for (int i = 1; i < rowIndex; i++) {
			Iterator<Integer> ite = array.iterator();
			pre = 1;
			neoArray = new LinkedList<Integer>();
			neoArray.add(1);
			ite.next();
			while (ite.hasNext()) {
				cur = ite.next();
				neoArray.add(cur + pre);
				pre = cur;
			}
			neoArray.add(1);
			array = neoArray;
		}
		return array;
	}
}