leetcode-Add Digits

Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.

For example:

Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, return it.

给一个非负整数，重复执行上面的操作，直到结果为一位数，返回该数。

public class Solution {    public int addDigits(int num) {       return (num-1)%9+1;    }}