Leetcode 258. Add Digits

文章作者:Tyan
博客:noahsnail.com  |  CSDN  |  简书

1. Description

Linked List Cycle II

2. Solution

  • Version 1
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution {
public:
int addDigits(int num) {
int n = num;
while(n > 9) {
n = calDigits(n);
}
return n;
}

private:
int calDigits(int m) {
int sum = 0;
while(m) {
int r = m % 10;
sum += r;
m = m / 10;
}
return sum;
}
};
  • Version 2
1
2
3
4
5
6
7
8
9
10
class Solution {
public:
int addDigits(int num) {
if(num == 0) {
return 0;
}
int res = num % 9;
return res==0?9:res;
}
};

Reference

  1. https://leetcode.com/problems/add-digits/description/
如果有收获,可以请我喝杯咖啡!