-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLeastCommonDenominator.py
44 lines (39 loc) · 1.36 KB
/
LeastCommonDenominator.py
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
# Takes a list of fractions and returns a list of those fractions converted into the least common denominator (do not reduce)
#
#https://www.codewars.com/kata/common-denominators/train/python
import unittest
def convertFracts(list):
if len(list) <= 1:
return list
else:
denominators = []
for l in list:
denominators.append(l[1])
denom = denominators[0] * denominators[1] // euclidsDivisor(denominators[0], denominators[1])
for d in denominators:
if d == denominators[0]:
continue
else:
denom = denom * d // euclidsDivisor(denom, d)
for fract in list:
div = denom // fract[1]
fract[0] = fract[0] * div
fract[1] = denom
return list
def euclidsDivisor(x, y):
if x is 0:
return y
elif y is 0:
return x
else:
if x > y:
return euclidsDivisor(y, x % y)
else:
return euclidsDivisor(x, y % x)
class test(unittest.TestCase):
def test_invertFracts(self):
self.assertEqual(convertFracts([[]]), [[]])
self.assertEqual(convertFracts([[2,6]]), [[2,6]])
self.assertEqual(convertFracts([[5, 15], [4, 12]]), [[20, 60], [20, 60]])
self.assertEqual(convertFracts([[1,2], [1,3], [1, 5]]), [[15,30],[10,30], [6,30]])
unittest.main()