題目

Write an algorithm to determine if a number is "happy".

A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy numbers.

Example: 19 is a happy number

1² + 9² = 82
8² + 2² = 68
6² + 8² = 100
1² + 0² + 0² = 1

解題思路

建立一個(gè)map numMap，用于存放每次計(jì)算出的新值
每次計(jì)算一個(gè)新值后，判斷該值是否為1，如果是1，則返回true
如果不是1，則判斷該值在map中是否存在，如果存在，則返回false
否則將新值放入map中

代碼

func getNewNum(num int) (newNum int) {
    for ; num > 0 ; {
        a := num % 10
        num = num / 10
        newNum += a * a
    }

    return newNum
}
func isHappy(n int) bool {
    var numMap map[int]bool
    numMap = make(map[int]bool)
    var newNum int
    newNum = n

    for {
        if 1 == newNum {
            return true
        }
        newNum = getNewNum(newNum)

        _, ok := numMap[newNum]
        if ok {
            return false
        } else {
            numMap[newNum] = true
        }
    }
}