leetcode-Happy Number

3/8/2017来源:ASP.NET技巧人气:14509

Question:

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

Solution:

class Solution { public: bool isHappy(int n) { if(n == 0){ return false; } n = getNum(n); unordered_set<int> mset; while(mset.insert(n).second){ if(n == 1){ return true; } n = getNum(n); } return false; } int getNum(int n){ int res = 0; while(n){ int tmp = n % 10; res += tmp * tmp; n /= 10; } return res; } };

总结:

unordered_set的函数insert返回值中各个版本都不一致:

(1) pair



湖北楚天风采22选5走势图
pk10怎么能稳赚不赔 体育彩票大乐透规则 彩名堂计划不会看 甘肃快3一牛 3d模拟投注 天津快乐10分计划 山西彩票快乐十分 现金打麻将有哪些平台 真钱网络捕鱼达人游戏 重庆幸运农场开奖号码 飞艇计划软件app下载苹果 王者捕鱼官方网站 内蒙古时时彩app 双色球往期号码查询 四川快乐12遗漏一定牛 河北福彩十一选五胆拖投注表