leetcode刷题日记——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

问题分析：题目是要判断一个正整数是否是一个开心数，满足示例条件的即为开心数。通过观察特征，可以用迭代来实现，重点需要解决的问题就是如何将循环的情况区别出来，后来发现，只要是循环的情况，4都会出现在循环链中，因此。我们以此来作为返回false的迭代终止条件。实现代码如下：

class Solution {
public:
    bool isHappy(int n) {
       while(1){
           if(n==1) return true;
           if(n==4) return false;
           int p=0;
           while(n){
               p+=pow(n%10,2);
               n/=10;
           }
           n=p;
       }
    }
};

当然，还可以有另外一种思路，比如说，既然题目提到不是开心数的会出现循环，那么我们就可以把每次的结果保存到一个vector中，然后在新增元素时判断这个元素是否已经出现过，如果出现过，肯定出现了循环。即可返回false.。

class Solution {
public:
    bool isHappy(int n) {
        vector<int> vec;
        while (n != 1){
          int temp = 0;
          while(n){
            temp += pow(n % 10, 2);
            n /= 10;
          }
          if (find(vec.begin(), vec.end(), temp) != vec.end()) return false;
          else vec.push_back(n = temp);
        }
        return true;
    }
};