leetcode-Happy Number

3/8/2017来源:澳门金沙娱乐场人气:24062

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



网站地图 申博棋牌游戏 申博太阳城 申博娱乐手机登入 太阳城申博
申博手机版下载网址 申博在线娱乐登入 申博游戏 申博游戏登录官网
申博直营网 申博 太阳城娱乐登入 盛618登入
幸运大转盘 申博娱乐登入 澳门博彩公司 菲律宾太城申博
保险百家乐 申博手机下载版 澳门金沙娱乐场 申博棋牌游戏