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.

class Solution {
public:
    int addDigits(int num) {
        if(num < 10) return num;
        int x = 0;
        while(num > 9)
        {
            x += num%10;
            num /= 10; 
            if(num < 10)
            {
                x += num;
                if(x > 9)
                {
                    num = x;
                    x = 0;
                }
            }
        }
        return x;
    }
};