【九日集训】每日打卡

1. 剑指 Offer 64. 求1+2+…+n

int sum(int n) {
    return n&&(n + sum(n - 1));
}

2. 2 的幂

bool isPowerOfTwo(int n) {
    if(n<0) return false;
        return n > 0 && (n & -n) == n;
 }

3. 3的幂

boolean isPowerOfThree(int n) {
    if (n <= 0) return false;
    while (n % 3 == 0){
        n /= 3;
    }
      return n == 1;
 }

4. 4的幂

boolean isPowerOfFour(int n){
       if (n==2 || n==3) return false;
       while(n>=4){
           if (n%4 != 0){
                return false;
          }else{
              n /= 4;
      if(n != 1){
           return false;
      }else{
           return true;
          }
     }
}

int kthFactor(int n, int k) {
    int count = 0;
    for (int factor = 1; factor <= n; ++factor) {
        if (n % factor == 0) {
            ++count;
            if (count == k) {
                return factor;
            }
        }
    }
    return -1;
}