2023.05.27 Problem: 202. Happy Number

[umdreamer]

202. Happy Number Problem Link

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. 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. Return true if n is a happy number, and false if not.

Example 1:

Input: n = 19
Output: true
Explanation:
12 + 92 = 82
82 + 22 = 68
62 + 82 = 100
12 + 02 + 02 = 1

Example 2:

Input: n = 2
Output: false

Constraints:

• 1 <= n <= 231 - 1

[zhjingyan]

[foxbou]

[Lggg1234]

[daowuwu]

[sjh397]

[promisewith7]

[PinkyLame]

[tangyexi]

[bedauern]

[liu-si-han]

[huangyumei1]

[mafanjia]

[wangshiqi7]

[gusuning]

[syr2212061031]

[ZWJ2212061008]

[1125766961]

[zxm-1235]

[yeyuxq]

[liuhuanyu6]

[xiaolu2002]

[123lrb]

[686xiaozhang]

[FXL1006]

[24zlx]

[naqianqpg]

[htywan]

[zyhzxy99]

[12baoxingyu-6]

[shylieisme]

[zangfushuo]

[xkqwww]

[cuixiao02]