【leetcode】Happy Numbers

最新推荐文章于 2024-10-08 10:36:00 发布

lpy_1991

最新推荐文章于 2024-10-08 10:36:00 发布

阅读量345

点赞数

文章标签： leetcode numbers

本文链接：https://blog.csdn.net/lpy_1991/article/details/45393187

版权

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

分析：

判断一个数是“happy number”比较容易，但是因为循环次数不定，因此如果一个数不是happy number，跳出循环的判断条件很关键。

经过测试发现，如果一个数不是happy number，则在循环过程中，计算出的新数会发生周期性重复。

因此设置一个bool型数组，初始化为false。每计算出一个新数，就将以该数位下标的数组位置为true。这样，计算出下一个新数时，只要判断这个数对应的数组位是不是true。如果是的话，就说明重复了，则肯定不是happy number

class Solution {
public:
    bool isHappy(int n) {

	int newsum=0;

	bool repeat[1000]={false};
	while(1)
	{
		repeat[newsum]=true;
		newsum=0;
		while(n){
			newsum += (double)pow(double(n%10), 2);
			n/=10;
		}

		
		if (newsum==1)
		{
			return true;
		}
		if (repeat[newsum])
		{
			return false;
		}
		n=newsum;

	}
	return false;
    }
};