202. Happy Number（C++）

题目：

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^2 + 9^2 = 82
8^2 + 2^2 = 68
6^2 + 8^2 = 100
1^2 + 0^2 + 0^2 = 1

解答：

和大多数人的做法不一样，这个做法省去了hash表

class Solution {
public:
int sums(int n){
    int sum=0;
    while(n!=0){
        int temp=n%10;
        sum+=temp*temp;
        n/=10;
    }
    return sum;
}
    bool isHappy(int n) {
        if(n==0)return false;
    int a,b;
    a=b=n;
    do{
        a=sums(a);
        b=sums(b);
        b=sums(b);
    }while(a!=b);
    if(a==1)return true;
    else return false;
    }
};