<output id="vc7nm"></output>
<big id="vc7nm"><menuitem id="vc7nm"></menuitem></big>

    <meter id="vc7nm"></meter>

    leetcode-Happy Number

    3/8/2017来源:ASP.NET技巧人气:9726

    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



    金诺时时彩软件怎么样

    <output id="vc7nm"></output>
    <big id="vc7nm"><menuitem id="vc7nm"></menuitem></big>

    <meter id="vc7nm"></meter>

    <output id="vc7nm"></output>
    <big id="vc7nm"><menuitem id="vc7nm"></menuitem></big>

    <meter id="vc7nm"></meter>
    ag真人厅骗子 上海时时乐开奖记录 莱特币矿池好 圣诞企鹅简笔画图片 德国斯图加特奥莱攻略 腾讯体育nba直播 im体育吧 大乐透后区选号技巧 法兰克福本菲卡 3d通七码复式v3.0下载