202. Happy Number

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

• 12 + 92 = 82
• 82 + 22 = 68
• 62 + 82 = 100

• 12 + 02 + 02 = 1

       my。 这也行。。  有点取巧。

class Solution {
public:
    bool isHappy(int n) {
        int cnt = 0;
        while(n != 1){
            int m = 0;
            while(n){
                m += pow(n % 10,2);
                n /= 10;
            }
            n = m;
            if(++cnt >10)
            return false;
            
        }
        return true;
        
    }
};

                     better...

class Solution {
public:
    bool isHappy(int n) {
        int slow = n, fast = n;
        do{
            slow = digitSquareSum(slow);
            fast = digitSquareSum(fast);
            fast = digitSquareSum(fast);
        }while(slow != fast);
        if(slow == 1)return true;
        else return false;
    }
    
    int digitSquareSum(int n) {
    int sum = 0, tmp;
    while (n) {
        tmp = n % 10;
        sum += tmp * tmp;
        n /= 10;
    }
    return sum;
}
};

map!

class Solution {
public:
    bool isHappy(int n) {
        unordered_map<int, int> repeat;
        while(repeat[n] == 0){
            repeat[n]++;
            sqaure_sum(n);
            if(n == 1)return true;}
         return false;
    }
    
    int sqaure_sum(int& n)
    {
        int sum = 0;
        while(n>0)
            {sum += (n%10) * (n%10);n/=10;}
        n = sum;
        return n;
    }

};