Posts Tagged 【math】Happy Number

Happy Number

  Total Accepted: 4647  Total Submissions: 14429 My Submissions

Question  Solution 

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.

/*
如果不是happy的话，那就是无穷循环了
记录每次中转的数字，看是否重新出现
*/
public class Solution {
    public boolean isHappy(int n) {
        int value = n;
    	List<Integer> list = new ArrayList<Integer>();
    	while(value!= 1 && !list.contains(value)) {
        	list.add(value);
    		value = newValue(value);
    	}
    	return value == 1;
    }
    private int newValue(int n) {
        int sum = 0;
        while(n > 9) {
            sum += Math.pow(n%10,2);
            n /= 10;
        }
        return sum += Math.pow(n, 2);
    }
}

Have you met this question in a real interview?