[Leetcode] Happy Number
来源:互联网 发布:淘宝卖家能给差评吗 编辑:程序博客网 时间:2024/06/07 02:25
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) { if(n<10) if((n==1)||(n==7)) return true; else return false; int sum=0; while(n>0) { sum+=(n%10)*(n%10); n=n/10; } return isHappy(sum); }}
0 0
- [leetcode] Happy Number
- leetcode: Happy Number
- [LeetCode] Happy Number
- [LeetCode]Happy Number
- LeetCode 202 Happy Number
- LeetCode OJ Happy Number
- [LeetCode]202.Happy Number
- LeetCode 202-Happy Number
- leetcode-202 Happy Number
- [LeetCode]Happy Number
- leetcode 202: Happy Number
- leetcode Happy Number
- [LeetCode 202]Happy Number
- LeetCode (24) Happy Number
- LeetCode Happy Number 题解
- [LeetCode] Happy Number
- leetcode 202 Happy Number
- LeetCode Happy Number
- 博客足迹
- [Leetcode] Power of Two
- 【light-oj】-1109 - False Ordering(数学)
- 工具类:Collections集合工具集
- 《Thinking in java》基础篇之位运算
- [Leetcode] Happy Number
- eeprom
- 将一个int的各个位解析到int数组
- CF371 D Searching Rectangles
- Xcode常用代码块整理
- Qt中“调试器未设置”的解决方法
- 正则表达式
- 泛型T的类型获取
- 位运算符