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. Thos…

happy.py

class Solution(object):
    def isHappy(self, n):
        """
        :type n: int
        :rtype: bool
        """
        seenNums = set()
        while n > 1 and (n not in seenNums):
            seenNums.add(n)
            n = sum(map(lambda x: x**2, map(int, list(str(n)))))
        return n == 1