【LeetCode】202. Happy Number
LeetCode number
2023-09-11 14:20:27 时间
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^2 + 9^2 = 82
- 8^2 + 2^2 = 68
- 6^2 + 8^2 = 100
- 1^2 + 0^2 + 0^2 = 1
Credits:
Special thanks to @mithmatt and @ts for adding this problem and creating all test cases.
循环计算每位数字的平方和,直到出现结果为1(返回true)或者重复(返回false)
class Solution { public: bool isHappy(int n) { unordered_map<int, bool> m; int sum = Helper(n); while(sum != 1) { if(m[sum] == true) return false; m[sum] = true; sum = Helper(sum); } return true; } int Helper(int n) {// sum of the squares of its digits int ret = 0; while(n) { int digit = n%10; n /= 10; ret += (digit*digit); } return ret; } };
相关文章
- Java实现 LeetCode 438 找到字符串中所有字母异位词
- Java实现 LeetCode 423 从英文中重建数字
- Java实现 LeetCode 292 Nim游戏
- Java实现 LeetCode 223 矩形面积
- Java实现LeetCode_0028_ImplementStrStr
- Java实现 LeetCode_0038_CountandSay
- 【LeetCode算法-9】Palindrome Number
- [LeetCode] Ugly Number II
- [LeetCode] Happy Number
- [LeetCode] Number of 1 Bits
- [LeetCode] Largest Number
- LeetCode(66): 加一
- LeetCode-883. 三维形体投影面积【几何,数学,数组,矩阵】
- 【LeetCode 25】K 个一组翻转链表
- 成功解决ValueError: Number of passed names did not match number of header fields in the file
- Leetcode 999. 可以被一步捕获的棋子数
- Leetcode 1957. 删除字符使字符串变好(可以,一次过)
- 力扣LeetCode,区域和检索 - 数组可修改
- [leetcode]Valid Number
- Median of Two Sorted Arrays--LeetCode
- leetcode 9. Palindrome Number
- leetcode 191. Number of 1 Bits
- leetcode 762. Prime Number of Set Bits in Binary Representation
- leetcode 476. Number Complement
- 【Leetcode刷题Python】509. 斐波那契数
- 【LeetCode】322. 零钱兑换