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

• 1² + 9² = 82
• 8² + 2² = 68
• 6² + 8² = 100
• 1² + 0² + 0² = 1

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