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
class Solution {
public:
bool isHappy(int n) {
int k=0,m=n,count=0;
vector<int>vec;
vector<int>::iterator result;
while(m!=1)
{
result = find( vec.begin(), vec.end(),count); //查找
if ( result != vec.end())//找到了
return false;
else
{
vec.push_back(count);
count=0;
while(m>0)
{
count += (m%10)*(m%10);//开始这里弄错了
m /= 10;
}
m=count;
}
}
return true;
}
};
人生有些关口非狠狠的斗一下不可,不能为了混口饭吃而自甘蹉跎。
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步