leetcode-Happy Number

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

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



上海天天彩选4专题信息 聊天主播一个月能赚钱 山东德州麻将如何玩 梦幻109凌波城怎么赚钱 中国足彩网竞彩比分 免费打麻将游戏下载 内蒙古快三 一部电影的收视率是怎么赚钱的 即时赔率亚洲盘口 漫画在哪发表能赚钱 直播吧足球直播 过年卖小烟花赚钱吗 腾讯大众麻将下载 天津时时彩 梦幻西游69级大唐如何赚钱 手机新浪体育网 单机捕鱼达人在线玩