202. Happy Number

标签：不为   数字   class   简单   square   return   determine   until   ret   

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

本题比较简单，做一个hashset来记录是否有重复的数字出现过，如果没有出现过，就把这个数加进去，然后求各位数平方和，看是否为1，不为1的话，就继续循环。代码如下：

 1 public class Solution {
 2     public boolean isHappy(int n) {
 3         Set<Integer> set = new HashSet<Integer>();
 4         if(n==1) return true;
 5         while(!set.contains(n)){
 6             set.add(n);
 7             int sum =0;
 8             while(n!=0){
 9                 int s = n%10;
10                 sum+=s*s;
11                 n = n/10;
12             }
13             if(sum==1) return true;
14             n = sum;
15         }
16         return false;
17     }
18 }

202. Happy Number

标签：不为   数字   class   简单   square   return   determine   until   ret   

原文地址：http://www.cnblogs.com/codeskiller/p/6537016.html