@requires_authorization
@author johnsondu
@create_time 2015.7.26 9:48
@url [Happy Number](https://leetcode.com/problems/happy-number/)
/************************
* @description: simple.
* @time_complexity: O(n)
* @space_complexity: O(n)
************************/
class Solution {
public:
bool isHappy(int n) {
bool flag = false;
map<int, int> mp;
mp[n] = true;
while(1) {
int cur = 0;
while(n) {
cur += (n % 10) * (n % 10);
n = n / 10;
}
if(cur == 1) {
flag = true;
break;
}
if(mp[cur]) break;
mp[cur] = true;
n = cur;
}
return flag;
}
};
【leetcode】202. Happy Number
最新推荐文章于 2022-12-25 17:59:02 发布