leetcode 202. Happy Number
来源:互联网 发布:淘宝质量好的女装店 编辑:程序博客网 时间:2024/06/07 03:20
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 boolean isHappy(int n) {HashSet<Integer> set=new HashSet<Integer>();while(n!=1&&!set.contains(n)){set.add(n);int sum=0;while(n>0){int yu=n%10;n=n/10;sum+=yu*yu;}n=sum;}if(n==1){return true;}else{return false;}}大神表示:看到大多数人都使用hashset来记录值。而实际上,我们可以使用 Floyd Cycle detection 算法,使用在 Linked List Cycle 找环的入口的方法。既然之后有循环,我们可以看做后面有环。我们只需要看这个环的入口值是不是1。
int digitSquareSum(int n) { int sum = 0, tmp; while (n) { tmp = n % 10; sum += tmp * tmp; n /= 10; } return sum;}bool isHappy(int n) { int slow, fast; slow = fast = n; do { slow = digitSquareSum(slow); fast = digitSquareSum(fast); fast = digitSquareSum(fast); } while(slow != fast); if (slow == 1) return 1; else return 0;}
阅读全文
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
- 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
- #leetcode#202. Happy Number
- leetcode-202. Happy Number
- Echarts数据可视化series-pie饼图,开发全解+完美注释
- 最值得研究的开源框架:来自百度的71款开源项目
- DBUtils的使用
- 基础数论算法(三) 逆元和gcd的几道题
- Echarts数据可视化series-radar雷达图,开发全解+完美注释
- leetcode 202. Happy Number
- log4j实战篇
- 大话数据结构 code 第七章 08最短路径_Floyd
- bzoj2287 [POJ Challeng]消失之物(01背包)
- Xcode 8制作framework步骤
- 多表查询SQL优化
- 使用tensorflow objet_detection API 实现遥感影像飞机模型识别全过程
- [LeetCode] 434. Number of Segments in a String
- 面向接口编程