Happy Number
来源:互联网 发布:linux应用程序设计教程 编辑:程序博客网 时间:2024/06/02 06:59
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.
class Solution {
public:
bool isHappy(int n) {
Set<Integer> set = new HashSet<Integer>();
while(n!=1){
int sum = 0;
while(n>0){
sum += (n % 10) * (n % 10);
n = n / 10;
}
if(set.contains(sum)){
return false;
} else {
set.add(sum);
}
n = sum;
}
return true;
}
};
根据快乐数的计算方法,我们很难在有限步骤内确定一个数是否是快乐数,但使用排除法的话,我们可以尝试确定一个数不是快乐数。根据题意,当计算出现无限循环的时候就不是快乐数。出现无限循环的说明产生了相同的结果,而判断相同结果只要用Set就行了。
- Happy Number
- Happy Number
- Happy Number
- Happy number
- Happy Number
- Happy Number
- Happy Number
- Happy Number
- Happy Number
- Happy Number
- Happy Number
- Happy Number
- Happy Number
- Happy Number
- Happy Number
- Happy Number
- Happy Number
- Happy Number
- 面试总结
- jquery.modal.js
- 用.net core 写后端—— c++外的另一种选择?
- [leetcode]567. Permutation in String
- IT痴汉的工作现状50-神秘的键盘声
- Happy Number
- SQL字符型字段按数字型字段排序实现方法
- 文章标题
- windows+mysql+python+navicat入坑指南
- 我为什么写博客
- 寻找前n个数的方法
- redis之持久化
- web.随笔之创建新元素与复制元素
- APP启动加载界面(第一种)