The fourth week of Leetcode problem brushing training

array Leetcode 119: Pascal's Triangle IIeasy Key to problem solving: Violent solution, construct pascal's triangle, find the row corresponding to rowIndex, and construct a List// Construct the logic of pascal's triangle. Note that the array length is rowIndex + 1 int[][] triangle = new int[rowIndex + 1][rowIndex + 1] for (int i = 0 ...

Posted by k994519 on Sun, 30 Jan 2022 13:39:24 +0100