Day7两个数组的交集&快乐数

两个数组的交集

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* intersection(int* nums1, int nums1Size, int* nums2, int nums2Size, int* returnSize){
    int num[1000]={0};
    int lessSize = nums1Size < nums2Size ? nums1Size : nums2Size;
    int * result = (int *) calloc(lessSize, sizeof(int));
    
    int i=0,j=0;
    for( i=0; i<nums1Size; i++ )
    {
        num[ nums1[i] ]++;
    }
    for( i=0; i<nums2Size; i++ )
    {
        if( num[ nums2[i] ] ) 
        {
            result[j++]=nums2[i];
            //注意清除内容，避免重复计算
            num[ nums2[i] ]=0;
        }
    }

    *returnSize = j;
    return result;
}

快乐数

bool isHappy(int n){
    int slow = n, fast = n;
    do
    {
        slow = bitSquareSum( slow );
        fast = bitSquareSum( fast );
        fast = bitSquareSum( fast );
    }while( slow !=fast );

    return slow == 1;
}

int bitSquareSum( int n )
{
    int sum=0;
    while( n>0 )
    {
        int bit = n % 10;
        sum += bit;
        n = n/10;
    }
    return sum;
}