-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAddDigits.java
More file actions
106 lines (84 loc) · 1.87 KB
/
AddDigits.java
File metadata and controls
106 lines (84 loc) · 1.87 KB
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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
<<<<<<< HEAD
//258. Add Digits
class Solution {
public int findDigits(int n){
int digit=0;
if (n==0) return 1;
while(n>0){
digit++;
n/=10;
}
return digit;
}
public int findSum(int n){
int sum=0;
int temp = n;
while(temp>0){
sum+=(temp%10);
temp/=10;
}
return sum;
}
public int addDigits(int num) {
int dig = findDigits(num),sum;
do{
sum = findSum(num);
num=sum;
dig = findDigits(sum);
}while(dig>1);
return sum;
}
}
/*
class Solution { //Mathematical trick
public int addDigits(int num) {
if(num==0)
return 0;
else if(num%9==0)
return 9;
else return num%9;
}
}
=======
//258. Add Digits
class Solution {
public int findDigits(int n){
int digit=0;
if (n==0) return 1;
while(n>0){
digit++;
n/=10;
}
return digit;
}
public int findSum(int n){
int sum=0;
int temp = n;
while(temp>0){
sum+=(temp%10);
temp/=10;
}
return sum;
}
public int addDigits(int num) {
int dig = findDigits(num),sum;
do{
sum = findSum(num);
num=sum;
dig = findDigits(sum);
}while(dig>1);
return sum;
}
}
/*
class Solution { //Mathematical trick
public int addDigits(int num) {
if(num==0)
return 0;
else if(num%9==0)
return 9;
else return num%9;
}
}
>>>>>>> be6ce0b427078b1421d5dd74adb2300dc02daeec
*/