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: 

Input: 19
Output: true
Explanation: 
12 + 92 = 82
82 + 22 = 68
62 + 82 = 100
12 + 02 + 02 = 1

代码：

方法一——无序集合：

class Solution {
public:
    bool isHappy(int n) {
        if (n < 0)return false;
	unordered_set<int>v;
	v.insert(n);
	int res = -1;
	while (1) {
		res = 0;
		while (n) {
			res += pow(n % 10, 2);
			n = n / 10;
		}
		if (res == 1)return true;
		if (v.count(res))return false;
		else {
			v.insert(res);
		}
		n = res;
	}
	return false;
    }
};

方法二——哈希表：

class Solution {
public:
    bool isHappy(int n) {
        unordered_map<int,int> tmp;
        
        while(n != 1)
        {
            if(tmp[n] == 0)
                tmp[n]++;
            else
                return false;
            
            int sum = 0;
            while(n != 0)
            {
                sum += pow(n % 10,2);
                n = n / 10;
            }
            
            n = sum;
        }
        
        return true;
    }
};