leetcode/numerical_reduction.cpp at master · Mayank-Parasar/leetcode · GitHub

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
//
// Created by Mayank Parasar on 2020-03-20.
//
/*
Code for reducing a numberr to a single digit
175 =  5+7 => 12 => 1+2 = 3 + 1 => 4
9999 = 9+9 =>9 + 9 => 9 =>9+9 = 9
*/

#include <iostream>
#include <vector>

using namespace std;

/* helper function */
vector<int> vectorize (int num) {
    vector<int> result;

    while(num >0) {
        result.push_back(num % 10);
        num = num / 10;
    }

    return result;
}


int reduce(int num) {
    vector<int> result = vectorize(num);
    int sum = 0;
    for(auto i : result) {
        sum += i;
        if(sum > 9) {
            sum = reduce(sum);
        }
    }

    return sum;
}

int main() {

    // vector<int> vec = vectorize(175);

    // for(auto i : vec) {
    // 	cout << i << " ";
    // }
    cout << endl;
    int reduced_sum = reduce(175);
    cout << "result after reducing the number: " << reduced_sum << endl;
    cout << endl;
    reduced_sum = reduce(9999);
    cout << "result after reducing the number: " << reduced_sum << endl;

    cout << endl;
    reduced_sum = reduce(526004760);
    cout << "result after reducing the number: " << reduced_sum << endl;

    cout << endl;
    reduced_sum = reduce(689697);
    cout << "result after reducing the number: " << reduced_sum << endl;

    return 0;
}