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

class Solution {public:    bool isHappy(int n) {        int temp;        bool isHappy = false;        int newNumber = 0;        unordered_set<int> showed;        while(!isHappy)        {            while(n != 0)            {                temp = n%10;                     n = n/10;                   newNumber += pow(temp,2);            }            n = newNumber;            if(newNumber==1)             {                return true;            }           else if(showed.find(newNumber)!=showed.end())           {                return false;            }            showed.insert(newNumber);                newNumber = 0;        }        return false;    }    };