2019.9.15 #程序员笔试必备# LeetCode 从零单刷个人笔记整理(持续更新)
所有非快乐数都会陷入一个循环,如何判断这个循环还有从这个循环中跳出,可以靠一个HashSet实现。
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.
编写一个算法来判断一个数是不是“快乐数”。
一个“快乐数”定义为:对于一个正整数,每一次将该数替换为它每个位置上的数字的平方和,然后重复这个过程直到这个数变为 1,也可能是无限循环但始终变不到 1。如果可以变为 1,那么这个数就是快乐数。
示例:
输入: 19
输出: true
解释:
1^2 + 9^2 = 82
8^2 + 2^2 = 68
6^2 + 8^2 = 100
1^2 + 0^2 + 0^2 = 1
import java.util.HashSet;
/**
*
* 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.
* 编写一个算法来判断一个数是不是“快乐数”。
* 一个“快乐数”定义为:对于一个正整数,每一次将该数替换为它每个位置上的数字的平方和,然后重复这个过程直到这个数变为 1,也可能是无限循环但始终变不到 1。如果可以变为 1,那么这个数就是快乐数。
*
*/
public class HappyNumber {
public boolean isHappy(int n) {
HashSet<Integer> set = new HashSet<>();
while(n != 1){
if(set.contains(n)){
return false;
}else{
set.add(n);
}
int num = 0;
while(n > 0){
num += Math.pow(n % 10, 2);
n /= 10;
}
n = num;
}
return true;
}
}
#Coding一小时,Copying一秒钟。留个言点个赞呗,谢谢你#