Happy Number
浏览数：33 /
时间：2015年06月11日
Happy Number
问题：
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.
思路：
hashset
我的代码：
public class Solution { public boolean isHappy(int n) { HashSet<Long> hs = new HashSet<Long>(); long num = n; while(!hs.contains(num)) { if(num == 1) return true; hs.add(num); long tmp = 0; while(num != 0) { long remain = num%10; tmp += remain * remain; num /= 10; } num = tmp; } return false; } }
郑重声明：本站内容如果来自互联网及其他传播媒体，其版权均属原媒体及文章作者所有。转载目的在于传递更多信息及用于网络分享，并不代表本站赞同其观点和对其真实性负责，也不构成任何其他建议。
