[LeetCode 202]Happy Number
来源:互联网 发布:制作短片的软件 编辑:程序博客网 时间:2024/05/05 03:41
题目链接: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
- 12 + 92 = 82
- 82 + 22 = 68
- 62 + 82 = 100
- 12 + 02 + 02 = 1
public class Solution { public boolean isHappy(int n) { Set<Integer> s = new HashSet<Integer>(); while(n != 1) { int sum = 0; while(n != 0) { int mod = n % 10; sum += mod * mod; n /= 10; } if(s.contains(sum)) return false; s.add(n = sum); } return true; }}
0 0
- 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
- Happy Number - LeetCode 202
- 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
- java---八皇后
- java.lang.reflect.InvocationTargetException
- 第七周项目一图形用户界面(GUI)应用成语开发初体验
- Sqoop
- WebService学习2:服务端发布服务、客户端调用服务
- [LeetCode 202]Happy Number
- 关于新参数DB_UNRECOVERABLE_SCN_TRACKING
- yii2学习笔记(六)访问
- zb的生日
- Flume
- 语法推导树之短语,直接短语,句柄
- 【C语言】“回文数”的判断
- Android框架基础-JNI
- 用例子来区分4种文法