leetcode 202

最新推荐文章于 2025-08-26 15:18:52 发布

dianpangzhun7106

最新推荐文章于 2025-08-26 15:18:52 发布

阅读量89

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/shellfishsplace/p/6046369.html

202. 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

利用递归求解，出口设置为参数为1返回true，参数出现过则返回false.

代码如下：

 1 class Solution {
 2 public:
 3     int sum;
 4     vector<int> re;
 5     bool isHappy(int n) {
 6         if(n == 1)
 7         {
 8             re.clear();
 9             return true;
10         }
11         else
12         {
13             int count = 0;
14             for(int i = 0; i < re.size(); i++)
15             {
16                 if(n == re[i])
17                 {
18                     count++;
19                 }
20                 if(count > 1)
21                 {
22                     return false;
23                 }
24             }
25         }
26         sum = 0;
27         while(n)
28         {
29             sum += (n%10) * (n%10);
30             n /= 10;
31         }
32         re.push_back(sum);
33         return isHappy(sum);
34     }
35 };