felixm/euler
1
0
Fork 0
Code Pull Requests Releases Activity

Solve problem 70 in Python.

Browse Source
This commit is contained in:
Felix Martin
2019-07-21 14:13:28 -04:00
parent 66e4593c4b
commit c47970642a
11 changed files with 168 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
python/lib_misc_tests.py
View File

@@ -14,6 +14,7 @@ try:
from .lib_misc import permutations
from .lib_misc import gcd
from .lib_misc import get_digit_count
from .lib_misc import is_permutation
except ModuleNotFoundError:
from lib_misc import is_palindrome_integer
from lib_misc import is_palindrome_string
@@ -29,6 +30,7 @@ except ModuleNotFoundError:
from lib_misc import permutations
from lib_misc import gcd
from lib_misc import get_digit_count
from lib_misc import is_permutation
class TestPrimeMethods(unittest.TestCase):
@@ -137,6 +139,12 @@ class TestPrimeMethods(unittest.TestCase):
self.assertEqual(get_digit_count(1), 1)
self.assertEqual(get_digit_count(1234567890), 10)
def test_is_permutation(self):
self.assertTrue(is_permutation(123, 321))
self.assertTrue(is_permutation(123, 321))
self.assertFalse(is_permutation(12, 321))
self.assertFalse(is_permutation(1235, 4321))
if __name__ == '__main__':
unittest.main()