leetcode-Happy Number

3/8/2017來源:ASP.NET技巧人氣:24362

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



大型正规棋牌平台 极速快3是正规的嘛 广东麻将怎么胡牌图解 斗地主技巧十句口诀表 银河dg视讯 11选5标志 棒球比分直播网 比特币挖矿机在做些什么 福建时时彩官网平台 e球彩奖金分配表 胜平负比分直播 宁夏11选5中奖规则 以太坊挖矿机显卡 美人捕鱼安卓官方版下载 悠闲山西麻将下载 彩票往期中奖号码查询结果 企业管理公司主要做什么