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走势图
快三吉林快三 内蒙古11选5哪个平台有 世界杯4分之一比分预测 内蒙古十一选五-走势图 浙江11选5走势 3d试机号历史开奖 排列3预测 福州麻将有什么技巧 湖南快乐十分遗漏湖南快乐十分投注 体彩百变王牌开奖结果 河南麻将规则图解 1分彩开奖时间 足球比分捷报比分 时时彩三星组选计划 今晚3d开奖结果查 福建十一选五免费计划