-
-
Notifications
You must be signed in to change notification settings - Fork 2.4k
/
Copy pathsum_of_digits.rs
116 lines (110 loc) · 3.05 KB
/
sum_of_digits.rs
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
107
108
109
110
111
112
113
114
115
116
/// Iteratively sums the digits of a signed integer
///
/// ## Arguments
///
/// * `num` - The number to sum the digits of
///
/// ## Examples
///
/// ```
/// use the_algorithms_rust::math::sum_digits_iterative;
///
/// assert_eq!(10, sum_digits_iterative(1234));
/// assert_eq!(12, sum_digits_iterative(-246));
/// ```
pub fn sum_digits_iterative(num: i32) -> u32 {
// convert to unsigned integer
let mut num = num.unsigned_abs();
// initialize sum
let mut result: u32 = 0;
// iterate through digits
while num > 0 {
// extract next digit and add to sum
result += num % 10;
num /= 10; // chop off last digit
}
result
}
/// Recursively sums the digits of a signed integer
///
/// ## Arguments
///
/// * `num` - The number to sum the digits of
///
/// ## Examples
///
/// ```
/// use the_algorithms_rust::math::sum_digits_recursive;
///
/// assert_eq!(10, sum_digits_recursive(1234));
/// assert_eq!(12, sum_digits_recursive(-246));
/// ```
pub fn sum_digits_recursive(num: i32) -> u32 {
// convert to unsigned integer
let num = num.unsigned_abs();
// base case
if num < 10 {
return num;
}
// recursive case: add last digit to sum of remaining digits
num % 10 + sum_digits_recursive((num / 10) as i32)
}
#[cfg(test)]
mod tests {
mod iterative {
// import relevant sum_digits function
use super::super::sum_digits_iterative as sum_digits;
#[test]
fn zero() {
assert_eq!(0, sum_digits(0));
}
#[test]
fn positive_number() {
assert_eq!(1, sum_digits(1));
assert_eq!(10, sum_digits(1234));
assert_eq!(14, sum_digits(42161));
assert_eq!(6, sum_digits(500010));
}
#[test]
fn negative_number() {
assert_eq!(1, sum_digits(-1));
assert_eq!(12, sum_digits(-246));
assert_eq!(2, sum_digits(-11));
assert_eq!(14, sum_digits(-42161));
assert_eq!(6, sum_digits(-500010));
}
#[test]
fn trailing_zeros() {
assert_eq!(1, sum_digits(1000000000));
assert_eq!(3, sum_digits(300));
}
}
mod recursive {
// import relevant sum_digits function
use super::super::sum_digits_recursive as sum_digits;
#[test]
fn zero() {
assert_eq!(0, sum_digits(0));
}
#[test]
fn positive_number() {
assert_eq!(1, sum_digits(1));
assert_eq!(10, sum_digits(1234));
assert_eq!(14, sum_digits(42161));
assert_eq!(6, sum_digits(500010));
}
#[test]
fn negative_number() {
assert_eq!(1, sum_digits(-1));
assert_eq!(12, sum_digits(-246));
assert_eq!(2, sum_digits(-11));
assert_eq!(14, sum_digits(-42161));
assert_eq!(6, sum_digits(-500010));
}
#[test]
fn trailing_zeros() {
assert_eq!(1, sum_digits(1000000000));
assert_eq!(3, sum_digits(300));
}
}
}