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走势图
电脑斗三公技巧 华东15选5 财通股票融资利息一般多少 译言网怎么翻译赚钱 北京快中彩 达人巧用四星稳赚平刷95命中率文库 ag平台注册 攒劲甘肃麻将在哪能下 手机麻将透视软件2019 任选3万能码 卡无卡五星麻将 蔡花宝典三肖六马4788 广西快3走基本走势图 金牌三肖六码中特综合资料 365娱乐场娱乐 天才麻将少女漫画