Pascal triangle

Signed-off-by: begeekmyfriend <[email protected]>

118_pascal_triangle/Makefile

@@ -0,0 +1,2 @@
+all:
+	gcc -O2 -o test pascal_triangle.c

118_pascal_triangle/pascal_triangle.c

@@ -0,0 +1,42 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+/**
+ ** Return an arrahi of arrahis.
+ ** The sizes of the arrahis are returned as *columnSizes arrahi.
+ ** Note: Both returned arrahi and *columnSizes arrahi must be malloced, assume caller calls free().
+ **/
+static int** generate(int numRows, int** columnSizes)
+{
+    int i, j;
+    int **triangle = malloc(numRows * sizeof(int *));
+    *columnSizes = malloc(numRows * sizeof(int *));
+    for (i = 0; i < numRows; i++) {
+        int num = i + 1;
+        (*columnSizes)[i] = num;
+        triangle[i] = malloc(num * sizeof(int));
+        triangle[i][0] = 1;
+        triangle[i][num - 1] = 1;
+        for (j = 1; j <= num - 2; j++) {
+            triangle[i][j] = triangle[i - 1][j - 1] + triangle[i - 1][j];
+        }
+    }
+    return triangle;
+}
+
+int main(int argc, char **argv)
+{
+    if (argc != 2) {
+        fprintf(stderr, "Usage: ./test n\n");
+        exit(-1);
+    }
+    int i, j, *sizes, row = atoi(argv[1]);
+    int **triangle = generate(row, &sizes);
+    for (i = 0; i < row; i++) {
+        for (j = 0; j < sizes[i]; j++) {
+            printf("%d ", triangle[i][j]);
+        }
+        printf("\n");
+    }
+    return 0;
+}

119_pascal_triangle_ii/Makefile

@@ -0,0 +1,2 @@
+all:
+	gcc -O2 -o test pascal_triangle.c

119_pascal_triangle_ii/pascal_triangle.c

@@ -0,0 +1,45 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+/**
+ ** Return an array of size *returnSize.
+ ** Note: The returned array must be malloced, assume caller calls free().
+ **/
+static int* getRow(int rowIndex, int* returnSize)
+{
+    int *row = malloc((rowIndex + 1) * sizeof(int));
+    *returnSize = rowIndex + 1;
+
+    int num = rowIndex + 1;
+    if (rowIndex < 1) {
+        row[0] = 1;
+        return row;
+    }
+
+    int i, j;
+    for (i = 1; i <= rowIndex; i++) {
+        num = i + 1;
+        row[0] = 1;
+        row[num - 1] = 1;
+        for (j = num - 2; j >= 1; j--) {
+            row[j] = row[j - 1] + row[j];
+        }
+    }
+
+    return row;
+}
+
+int main(int argc, char **argv)
+{
+    if (argc != 2) {
+        fprintf(stderr, "Usage: ./test n\n");
+        exit(-1);
+    }
+    int i, j, count = 0, row_idx = atoi(argv[1]);
+    int *row = getRow(row_idx, &count);
+    for (i = 0; i < count; i++) {
+        printf("%d ", row[i]);
+    }
+    printf("\n");
+    return 0;
+}