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
思路：
採用set來判斷容器中是否有該元素出現過，如果出現過，那麼就形成了環狀，結果返回false。否則找到快樂數字。返回true。
代碼如下：
class Solution {
public:
bool isHappy(int n) {
set<int > myset;
int total = 0;
while(n != 1)
{
while(n)
{
total += (n%10)*(n%10);
n /= 10;
}
if(total == 1)
return true;
if(myset.find(total) != myset.end())
return false;
else
myset.insert(total);
n = total;
total = 0;
}
return true;
}
};關於set容器的使用練習。
2016-08-13 13:49:32