leetcode解题之202 # Happy Number Java版 (开心数)
来源:互联网 发布:战舰世界轰鸣数据 编辑:程序博客网 时间:2024/06/01 08:22
202. 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
- 题目大意
对任意一个正整数,不断求个数位上数字的平方和,若最终收敛为1,则该数字为happy number,否则程序可能从某个数开始陷入循环。
解题思路
对这个数字的每个数位求平方和,如果如和为1或者平方和是之前出现过的就不进行求和,根据最后的结果判断是不是一个开心数字。
public boolean isHappy(int n) {if (n == 0)return false;if (n == 1)return true;int temp = 0;//set 储存中间的结果Set<Integer> set=new HashSet<>();while (n != 1) {if (set.contains(n))return false;set.add(n);while (n != 0) {temp=temp+(n%10)*(n%10);n /= 10;}n = temp;temp=0;}return true;}
0 0
- leetcode解题之202 # Happy Number Java版 (开心数)
- LeetCode 202 Happy Number(开心数)(vector、unordered_set)
- LeetCode OJ 之 Happy Number (happy数)
- 【LeetCode-面试算法经典-Java实现】【202-Happy Number(开心数字)】
- 202. Happy Number | 开心数
- [leetcode-202]Happy Number(java)
- LeetCode-Happy Number-解题报告
- 【LeetCode】 Happy Number 解题报告
- (LeetCode)Happy Number -- 寻找快乐数
- LeetCode(202) Happy Number
- LeetCode之Happy Number
- leetcode之happy number
- leetcode之Happy Number
- LeetCode之Happy Number
- [LeetCode]Happy Number(Java)
- Leetcode 快乐数Happy Number
- leetcode -- happy number 快乐数
- LeetCode之旅(18)-Happy Number
- Java反射机制详解
- 看完让你彻底搞懂Websocket原理
- 高德地图地理编码和逆地理编码
- jQuery :checkbox 选择器
- ACM程序设计 -O 气球问题(相同字符串)
- leetcode解题之202 # Happy Number Java版 (开心数)
- IDEA里面创建maven项目,依赖
- Java 读书笔记21.3 并发(重点)
- web地图快照技术
- 新手笔记:常用命令
- 大端存储格式与小端存储格式
- CSU 1808 地铁 (Dijkstra)
- Android 热修复
- C#7.0之ref locals and returns (局部变量和引用返回,之前欠大家的,现在补上)