202. Happy Number Leetcode Python
来源:互联网 发布:偷水仙花包饺子 知乎 编辑:程序博客网 时间:2024/05/17 05:53
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
- 12 + 92 = 82
- 82 + 22 = 68
- 62 + 82 = 100
- 12 + 02 + 02 = 1
Credits:
Special thanks to @mithmatt and @ts for adding this 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() while n not in val: val.add(n) newn = 0 while n != 0: newn += (n % 10) * (n % 10) n /= 10 n = newn if n == 1: return True return False
0 0
- 202. Happy Number Leetcode Python
- [leetcode: Python]202.Happy Number
- [LeetCode]202.Happy Number
- 【LeetCode】202.happy number
- LeetCode 202. Happy Number
- [leetcode] 202.Happy Number
- 【leetcode】202. Happy Number
- [leetcode] 202. Happy Number
- 202. Happy Number LeetCode
- leetCode 202. Happy Number
- [LeetCode]202. Happy Number
- leetcode 202. Happy Number
- leetcode 202. Happy Number
- LeetCode *** 202. Happy Number
- leetcode 202. Happy Number
- leetcode 202. Happy Number
- LeetCode 202. Happy Number
- leetcode 202. Happy Number
- union在XMMATRIX里的妙用
- git review (三)
- 关于框架
- 热度体育科技和规范性儿童已经很高
- 第六章 电磁新理论(修补章)
- 202. Happy Number Leetcode Python
- windows 7上运行docker
- 自定义构造方法和description方法
- 203. Remove Linked List Elements Leetcode Python
- poj 2828 tickets
- Lintcode - Segment Tree Build
- Lintcode - Segment Tree Query
- 仿IDF实验室的CTF平台
- CircleImageView