[April 2th]Happy Number——[Python3/C++ Solution]

Happy Number

Write an algorithm to determine if a number n 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.

Return True if n is a happy number, and False if not.

Example:

Input: 19
Output: true
Explanation: 
1^2 + 9^2 = 82
8^2 + 2^2 = 68
6^2 + 8^2 = 100
1^2 + 0^2 + 0^2 = 1

Python3 Solution:

class Solution:
    def isHappy(self, n: int) -> bool:
        if n < 1:
            return False
        if n == 1:
            return True
        dic = [n]
        while True:
            num = 0
            while n:
                temp = n % 10
                n = n // 10
                num += temp * temp
            if num == 1:
                return True
            elif num in dic:
                return False
            dic.append(num)
            n = num
        return False

C++ Solution:

class Solution {
public:
    unordered_set<int> bobo;
    bool isHappy(int n) {
        int sum = 0;
        if(n == 1) return true;
        else if(bobo.count(n))  return false;
        else{
            bobo.insert(n);
            while(n != 0){
                sum = sum + (n%10) * (n%10);
                n /= 10;
            }
            n = sum;
        }
        return isHappy(n);
    }
};