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 and replace the number by the Sum of the squares of its digits, and repeat the process until the number equals 1 (where it would stay), or it loops Endl essly in a cycle which does not include 1. Those numbers for which this process ends in 1 is happy numbers.
Example: is a happy number
- 12 + 92 = 82
- 82 + 22 = 68
- 62 + 82 = 100
- 12 + 02 + 02 = 1
Credits:
Special thanks to @mithmatt and @ts for adding the problem and creating all test cases.
This algorithm need to validate its digits.
Class solution: # @param {integer} n # @return {boolean} def ishappy (self, N): val = set () and n not In Val: val.add (n) newn = 0 while n! = 0: newn + = (n) * (n) n/= n = newn if n = = 1: return True return False
202. Happy number Leetcode Python