摘要：
address int fib(int n){ if(n == 0) return 0; if(n == 1) return 1; int a[n+1]; a[0] = 0; a[1] = 1; for(int i = 2; i<=n; i++) a[i] = (a[i-1] + a[i-2])%1 阅读全文
posted @ 2021-01-21 20:25
RougeBW
阅读(47)
评论(0)
推荐(0)
摘要：
同主站154题 address int minArray(int* numbers, int numbersSize){ if(numbersSize == 1) return numbers[0]; int i = 0; while((i<numbersSize-1) && (numbers[i] 阅读全文
posted @ 2021-01-21 20:20
RougeBW
阅读(33)
评论(0)
推荐(0)
摘要：
address /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ /** * Note: The returned array must b 阅读全文
posted @ 2021-01-21 20:18
RougeBW
阅读(39)
评论(0)
推荐(0)
摘要：
同主战的70 address int numWays(int n){ if(n==0) return 1; int A[n+1]; A[0] = 1; A[1] = 1; for (int i = 2;i<= n;i++) A[i] = (A[i-1] + A[i-2])%1000000007; r 阅读全文
posted @ 2021-01-21 18:44
RougeBW
阅读(38)
评论(0)
推荐(0)
摘要：
address /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ struct ListNode* getKthFromEnd(struct 阅读全文
posted @ 2021-01-21 07:01
RougeBW
阅读(32)
评论(0)
推荐(0)
浙公网安备 33010602011771号