leetcode:202. Happy Number

又是放弃治疗的题，，，

肯定有别的简单的方法，菜，，，已经懒得思考了

class Solution {
public:
    bool isHappy(int n) {
        if(n==1) return true;
        int sum=0;
        int a=n%10;
        int b=n/10;
        sum=pow(a,2)+pow(b,2);
        printf("%d ,%d ,%d",a ,b ,sum);
        return isHappy(sum);
        // return false;
    }
};

 

 

基本在玩数学了？

class Solution {
public:
    bool isHappy(int n) {
        while (true) {
            if (n == 1) { return true; }
            if (n == 4) { return false; }
            int next = 0;
            while (n) { next += (n % 10) * (n % 10), n /= 10; }
            n = next;
        }    
    }
};

If the next number in the sequence is 1, then the original number was happy. If it was not happy, we enter a cycle that contains the number 4. We could use a cycle detection strategy to do this also, or just test for a given number in the (short) cycle as done here.