标签：
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
https://leetcode.com/problems/happy-number/
1 /** 2 * @param {number} n 3 * @return {boolean} 4 */ 5 var isHappy = function(n) { 6 if(n === 1 || n === 7) return true; 7 if(n < 10) return false; 8 n = n.toString(); 9 var nextNum = 0, tmp; 10 for(var i = 0; i < n.length; i++){ 11 tmp = Math.floor(n[i]); 12 nextNum += tmp * tmp; 13 } 14 return isHappy(nextNum); 15 };
[LeetCode][JavaScript]Happy Number
标签：
原文地址：http://www.cnblogs.com/Liok3187/p/5223912.html
