@@ -0,0 +1,479 @@
+/**%0A * Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.%0A * For example: Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, return it.%0A **/%0A %0Apublic class Solution %7B%0A    public int addDigits(int num) %7B%0A        int result = 0;%0A        if(num %3C 10)    return num;%0A        while(num %3E 0)%7B%0A            result += num%2510;%0A            num /= 10;%0A        %7D%0A        return addDigits(result);%0A    %7D%0A%7D%0A

Create 258.java