leetcode
qq_35785763
这个作者很懒,什么都没留下…
展开
-
leetcode 485
int findMaxConsecutiveOnes(int* nums, int numsSize) { int i,max=0,tmp=0; for (i = 0;i < numsSize;i++) { if (nums[i]) tmp++; else { if原创 2017-01-16 07:51:06 · 211 阅读 · 0 评论 -
leetcode 448
/*** Return an array of size *returnSize.* Note: The returned array must be malloced, assume caller calls free().*/int* findDisappearedNumbers(int* nums, int numsSize, int* returnSize) { int* t原创 2017-01-16 09:45:35 · 274 阅读 · 0 评论