leetcode

commit 993559985758d2f1ef654a61a54f9a5e076e7924
parent 3fe72da51a64e5627d994eeea9dc4fdf9dc709f6
Author: AndrewLockVI <andrewlaack1@gmail.com>
Date:   Mon, 15 May 2023 10:08:59 -0500

Completed unoptimized recursive solution for pascals triangle

Diffstat:
A
pascals-triangle/pascals-triangle.dart
 | 
25
+++++++++++++++++++++++++

1 file changed, 25 insertions(+), 0 deletions(-)
diff --git a/pascals-triangle/pascals-triangle.dart b/pascals-triangle/pascals-triangle.dart
@@ -0,0 +1,25 @@
+//Given a number of rows return the values contained in each
+//row of pascals triangle. This solution is a brute force recursion
+//solution with a time complexity of O(n^2)
+//Time: 346ms Beats: 5.81%
+//Memory: 141.3MB Beats: 22.9%
+class Solution {
+  List<List<int>> generate(int numRows) {
+      if(numRows == 1){
+          return [[1]];
+      }
+      
+     
+
+      List<List<int>> return_list = generate(numRows-1);
+      return_list.add([]);
+      List<int> last_row = return_list[return_list.length - 2];
+      List<int> current_row = return_list[return_list.length - 1];
+      current_row.add(1);
+      for(int i = 1 ; i < last_row.length ; ++i){
+        current_row.add(last_row[i - 1] + last_row[i]);
+      }
+      current_row.add(1);
+      return return_list;
+  }
+}