leetcode-Happy Number

3/8/2017来源:澳门博彩公司人气:26730

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网址 申博手机下载版 申博开户
菲律宾太阳娱乐管理登入 菲律宾太阳城申博官方网站 金太阳国际娱乐网址 申博直营网
ag娱乐登入 菲律宾太城申博 申博娱乐 百家乐登入网址
太阳城娱乐登入 申博客户端下载 太阳城亚洲开户 申博电子游戏
申博棋牌游戏 申博真人游戏 申博娱乐官网 申博现金网址