Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

public boolean isHappy(int n) { if(1 <= n && n <= 9){ return n == 1 || n == 7; } int num = 0; while(n != 0){ num += Math.pow(n%10, 2); n /= 10; } return isHappy(num); }

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.