[LeetCode 263,268][简单]丑数/缺失数字

263.丑数
题目链接

class Solution {
public:
    bool isUgly(int num) {
        while(num&&(num&1)==0)num>>=1;
        while(num&&(num%3)==0)num/=3;
        while(num&&(num%5)==0)num/=5;
        if(num==1)return true;
        else return false;
    }
};

268.缺失数字
题目链接

class Solution {
public:
    int missingNumber(vector<int>& nums) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        int n = nums.size(),s = 0;
        for(int i = 0; i < n; i++)s = s ^ nums[i] ^ i;
        return s ^ n;
    }
};