摘要：
1 /** 2 * Definition for singly-linked list. 3 * struct ListNode { 4 * int val; 5 * struct ListNode *next; 6 * }; 7 */ 8 9 10 struct ListNode* deleteN 阅读全文
摘要：
1 /** 2 * Note: The returned array must be malloced, assume caller calls free(). 3 */ 4 int* printNumbers(int n, int* returnSize){ 5 int top, i, j, *n 阅读全文
摘要：
三角形最小路径和 1 void trianglePrint(int** triangle, int triangleSize, int* triangleColSize){ 2 int i, j; 3 for (i=0; i<triangleSize; ++i){ 4 for (j=0; j<tri 阅读全文