-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathadd-digits.cpp
More file actions
46 lines (33 loc) · 756 Bytes
/
Copy pathadd-digits.cpp
File metadata and controls
46 lines (33 loc) · 756 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
//question//
Given an integer num, repeatedly add all its digits until the result has only one digit, and return it.
Example 1:
Input: num = 38
Output: 2
Explanation: The process is
38 --> 3 + 8 --> 11
11 --> 1 + 1 --> 2
Since 2 has only one digit, return it.
Example 2:
Input: num = 0
Output: 0
Constraints:
0 <= num <= 231 - 1
//solution//
class Solution {
public:
int addDigits(int num) {
unsigned int ans = 0;
while(num>0)
{
unsigned int rem = num%10;
ans += rem;
num = num/10;
if(num==0 && ans>9)
{
num = ans;
ans = 0;
}
}
return ans;
}
};