Leetcode:add Digits

title link : https://leetcode.com/problems/add-digits/

title :

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

For example:

Givennum = 38, the process is like:3 + 8 = 11,1 + 1 = 2. Since2have only one digit, return it.

Test Instructions : Given a non-negative integer num, the digits are added repeatedly until only one of the results has been reached.

The topic is very simple, direct code bar ~

public class Solution {public    int adddigits (int num) {        int result = 0;        int Gewei = 0;                if (NUM/10 = = 0)            return num;                while (num! = 0) {            Gewei = num%;            result + = Gewei;            num/=;        }                if (result >=)            return adddigits (result);        else            return result;}    }

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Leetcode:add Digits