@@ -0,0 +1,886 @@
+/**%0A * Write an algorithm to determine if a number is %22happy%22. A happy number is a number defined by the following process: %0A * Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process %0A * until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers %0A * for which this process ends in 1 are happy numbers. %0A * Example: 19 is a happy number%0A * 12 + 92 = 82%0A * 82 + 22 = 68%0A * 62 + 82 = 100%0A * 12 + 02 + 02 = 1%0A **/%0Apublic class Solution %7B%0A  public boolean isHappy(int n) %7B%0A    if(n %3C= 0)  return false;%0A    int sum = sumSqures(n);%0A    while(sum/10 %3E 0)%0A        sum = sumSqures(sum);%0A    return sum == 1;%0A  %7D%0A  private int sumSqures(int n) %7B%0A    int result = 0;%0A    do %7B%0A        result += Math.pow(n%2510, 2);%0A        n/=10;%0A    %7D while(n%3E0);%0A    return result;%0A  %7D%0A%7D%0A

Create 202.java