LeetCode:Happy Number

Happy Number

Total Accepted: 41299  Total Submissions: 121770  Difficulty: Easy

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

Credits:
Special thanks to @mithmatt and @ts for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

Hide Tags
  Hash Table Math
Show Similar Problems





























思路:

1.使用map(map<int,int> mapint),将n置为1(mapint[n]=1);

2.计算各数的平方和t,将t置1(mapint[t]=1);n=t;

3.当1==n时,true;

4.当map中出现重复数时,false


code:

class Solution {
public:
    bool isHappy(int n) {
        map<int,int> mapint;
        while(n!=1) {
            if(mapint[n]) return false;
            mapint[n]=1;
            int t=0;
            while(n) {
                t += (n%10)*(n%10);
                n /= 10;
            }
            n=t;
        }
        return true;
    }
};


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值