ÈÕ¹°Ò»×䣬Ô½øÒ»²½£¨12£©

int findMaxConsecutiveOnes(int* nums, int numsSize)
 {
       int count=0;
       int maxLenth=0;
    for(int i=0;i<numsSize;i++)
    {
        if(nums[i]==1)
        {
            count++;
            if(count>maxLenth)
            {
                maxLenth=count;
            }
        }
        else
        count=0;
    }
    return maxLenth;
 }

/* ½â·¨1 ±©Á¦·¨, ʱ¼ä¸´ÔÓ¶ÈO(n1*n2) */
int* nextGreaterElement(int* nums1, int nums1Size, int* nums2, int nums2Size, int* returnSize){
    int i, j;
    int *res = (int*)malloc(sizeof(int) * nums1Size);

    for (i = 0; i < nums1Size; i++) {
        res[i] = -1;
        /* ÔÚnums2ÖÐÕÒµ½nums1[i] */
        for (j = 0; j < nums2Size; j++) {
            if (nums2[j] == nums1[i]) {
                break;
            }
        }
        /* ÕÒµ½ÏÂÒ»¸ö¸ü´óµÄÔªËØ, Êä³ö½á¹û */
        for (j = j + 1; j < nums2Size; j++) {
            if (nums2[j] > nums1[i]) {
                res[i] = nums2[j];
                break;
            }
        }
    }
    *returnSize = nums1Size;
    return res;
}