Day2: 循环问题

N！: 等差数列

func sumNums(n int) int {
    return (1+n)*n/2
}

2的幂

func isPowerOfTwo(n int) bool {
    if n == 0 {
        return false
    }
    return n&(n-1) == 0
}

3的幂

func isPowerOfThree(n int) bool {
    if n % 3 != 0 {
        if n == 1 {
            return true
        }
        return false
    }

    for n > 0 && n % 3 == 0{
        n /= 3
    }
    return n == 1
}

4的幂

func isPowerOfFour(n int) bool {
    if n == 0 {
        return false
    }
    if n&(n-1) != 0 {
        return false
    }
    if n & 0xaaaaaaaa == 0 {
        return true
    }
    return false
}

有效的完全平方数

func isPerfectSquare(num int) bool {
    return !(binarySearch(0, num, num) == -1)
}

func binarySearch(start, end int, target int) int {
    for start <= end {
        mid := (start + end) >> 1
        res := mid * mid
        if res > target {
            end = mid - 1
        } else if res < target {
            start = mid + 1
        } else {
            return mid
        }
    }
    return -1
}

n的第K个因子

func kthFactor(n int, k int) int {
    count, index := 0, 1
    for ; index * index <= n; index++ {
        if n % index == 0 {
            count++
            if count == k {
                return index
            }
        }
    }
    index--
    if index * index == n {
        index--
    }
    for ; index > 0; index-- {
        if n % index == 0 {
            count++
            if count == k {
                return n / index
            }
        }
    }
    return -1
}