《算法零基础100讲》(第42讲) 位运算 (位与) 入门

今天的题目算是水题吧，几道做过！！！

第一道题：位1的运算https://leetcode-cn.com/problems/number-of-1-bits/https://leetcode-cn.com/problems/number-of-1-bits/

int hammingWeight(uint32_t n) {
    int sum=0;
    while(n)
    {
        n=n&(n-1);
        sum++;
    }
    return sum;
}

第二道题：二进制中1的个数https://leetcode-cn.com/problems/er-jin-zhi-zhong-1de-ge-shu-lcof/https://leetcode-cn.com/problems/er-jin-zhi-zhong-1de-ge-shu-lcof/

int hammingWeight(uint32_t n) {
    int sum=0;
    while(n)
    {
        n=n&(n-1);
        sum++;
    }
    return sum;
}

第三道题：根据数字二进制下1的数目排序https://leetcode-cn.com/problems/sort-integers-by-the-number-of-1-bits/https://leetcode-cn.com/problems/sort-integers-by-the-number-of-1-bits/

int fun(int n)
{
    int sum=0;
    while(n)
    {
        if(n&1)
        {
            sum++;
        }
        n=n/2;
    }
    return sum;
}
int* sortByBits(int* arr, int arrSize, int* returnSize){
    int *ans=(int*)malloc(sizeof(int)*arrSize);
    for(int i=0;i<arrSize;i++)
    {
        for(int j=0;j<arrSize-i-1;j++)
        {
            if(fun(arr[j])>fun(arr[j+1]))
            {
                int t=arr[j];
                arr[j]=arr[j+1];
                arr[j+1]=t;
            }
            else if(fun(arr[j])==fun(arr[j+1]))
            {
                if(arr[j]>arr[j+1])
                {
                    int t=arr[j];
                    arr[j]=arr[j+1];
                    arr[j+1]=t;
                }
            }
        }
    }
    *returnSize=arrSize;
    return arr;
}

第四道题：二进制表示中质数个计算置位https://leetcode-cn.com/problems/prime-number-of-set-bits-in-binary-representation/https://leetcode-cn.com/problems/prime-number-of-set-bits-in-binary-representation/

int fun(int n)
{
    int sum=0;
    while(n)
    {
        if(n&1)
        {
            sum++;
        }
        n=n/2;
    }
    return sum;
}

int ll(int n)
{
    int flag=0;
    if(n<2)
    {
        return 0;
    }
    else
    {
        for(int i=2;i<=sqrt(n);i++)
        {
            if(n%i==0)
            {
                return 0;
            }
        }
    }
    return 1;
}
int countPrimeSetBits(int left, int right){
    int ans[10001]={0};
    int k=0;
    int sum=0;
    for(int i=left;i<=right;i++)
    {
        ans[k++]=fun(i);
    }

    for(int i=0;i<k;i++)
    {
        if(ll(ans[i]))
        {
            sum++;
        }
    }
    return sum;
}

第五道题：2的幂https://leetcode-cn.com/problems/power-of-two/https://leetcode-cn.com/problems/power-of-two/

bool isPowerOfTwo(int n){
    int sum=0;
    for(int i=0;i<=sqrt(n)+1;i++)
    {
        if(pow(2,i)==n)
        {
            return true;
        }
    }
    return false;
}

每天坚持一点点，努力一点点，保持进步的态度！有兴趣的点一下关注