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
• 
  

#include <set>

using namespace std;

class Solution {

    inline int getDigitSum( int n){

        int ans = 0;
        while( n ) {
        int temp = n % 10;
            ans += temp * temp;
            n /= 10;
        }

        return ans;
    }

public:
    bool isHappy(int n) {
        set<int> numbers;

        while(1){

            int temp = getDigitSum(n);
            if ( 1 == temp ) {
                return true;
            }

            if ( false == numbers.insert(temp).second ) {
                return false;
            }
            n = temp;

        }

    }

};