Leetcode 202

202. Happy Number

My Submissions

Question

Total Accepted: 57450  Total Submissions: 160293  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

在1到9当中只有 1 和7 是happy number，其余都不是。因此可以设计这样写 ；

class Solution {
public:
    bool isHappy(int n) {
     int tmp = 0 ;
     while ( n > 6 ) {
     while (n) {tmp += (n%10)*(n%10) ; n=n/10 ; }     
         n = tmp ;
         tmp = 0 ;
     }
     return n==1 ;
    }
};