每日一题之2的重新排序

题述

输出输入

代码

class Solution 
{
public:
    bool check(int targ, int num)
    {
        int a[10];
        memset(a, 0, sizeof(a));
        int b[10];
        memset(b, 0, sizeof(b));
        while (targ != 0)
        {
            int x = targ % 10;
            ++ a[x];
            targ /= 10;
        }
        while (num != 0)
        {
            int x = num % 10;
            ++ b[x];
            num /= 10;
        }
        for (int x = 0; x < 10; x ++)
        {
            if (a[x] != b[x])
            {
                return false;
            }
        }
        return true;
    }


    bool reorderedPowerOf2(int n) 
    {
        for (int i = 0; i < 31; ++ i)
        {
            int targ = (int)pow(2, i);
            if (check(targ, n) == true)
            {
                return true;
            }
        }
        return false;
    }
};